zoukankan      html  css  js  c++  java
  • 442. Find All Duplicates in an Array

    Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

    Find all the elements that appear twice in this array.

    Could you do it without extra space and in O(n) runtime?

     

    Example:

    Input:

    [4,3,2,7,8,2,3,1]

     

    Output:

    [2,3]

    idea: similar methods with 448 Find All Numbers Disappeared in an Array

    Solution 1: If nums[index] is already <0, index+1 is the duplicated number

     1 class Solution {
     2 public:
     3     vector<int> findDuplicates(vector<int>& nums) {
     4         int n=nums.size();
     5         vector<int> res;
     6         for (int i=0;i<n;i++){
     7             int index=abs(nums[i])-1; 
     8             if (nums[index]<0) res.push_back(abs(nums[i])); //diff with 448
     9             else nums[index]=-nums[index];
    10         }
    11         return res;
    12     }
    13 };

    Solution 2: If nums[i]!= i+1, nums[i] is the duplicated number.

     1 class Solution {
     2 public:
     3     vector<int> findDuplicates(vector<int>& nums) {
     4         int n=nums.size();
     5         vector<int> res;
     6         for (int i=0;i<n;i++){
     7             int index=nums[i]-1;
     8             if (nums[index]!=nums[i]) {
     9                 swap (nums[i],nums[index]);
    10                 --i;
    11             }
    12         }
    13         for (int i=0;i<n;i++){
    14             if (nums[i]!=i+1) res.push_back(nums[i]); //diff with 448
    15         }
    16         return res;
    17     }
    18 };

    Solution 3: If nums[i]>2*n, i+1 is the duplicated number.

     1 class Solution {
     2 public:
     3     vector<int> findDuplicates(vector<int>& nums) {
     4         int n=nums.size();
     5         vector<int> res;
     6         for (int i=0;i<n;i++){
     7             nums[(nums[i]-1)%n]+=n;
     8         }
     9         for (int i=0;i<n;i++){
    10             if (nums[i]>2*n) res.push_back(i+1); //diff with 448
    11         }
    12         return res;
    13     }
    14 };
  • 相关阅读:
    Kafka官方文档V2.7
    提交pr记录
    用Go语言来运行简单的hello world
    Mybatis学习记录-最简单的mybatis工程
    Flink CDC 实践记录
    CarbonDataDDL翻译003
    CarbonData使用案例
    CarbonData快速开始001
    如何构建数据仓库分层
    使用mybatis-plus的自动生成器生成代码
  • 原文地址:https://www.cnblogs.com/anghostcici/p/6664352.html
Copyright © 2011-2022 走看看