leetcode/Duplicates_in_range_1_n.cpp at master · ankurmoh/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        int i,sz=nums.size(),ind;
        vector<int>res;
        if(sz==0)
            return res;
        for(i=0;i<sz;i++)
        {
            ind = abs(nums[i])-1;
            if(nums[ind]>0)
                nums[ind] = -nums[ind];
        }
        for(i=1;i<=sz;i++)
        {
            if(nums[i-1]>0)
                res.push_back(i);
        }
        return res;
    }
};

class Solution {
public:
    vector<int> findDuplicates(vector<int>& nums) {
        int i,sz=nums.size(),ind;
        vector<int>res;
        if(sz==0)
            return res;
        for(i=0;i<sz;i++)
        {
            ind = abs(nums[i])-1;
            nums[ind] = -nums[ind];
        }
        for(i=0;i<sz;i++)
        {
            ind = abs(nums[i])-1;
            if(nums[ind]>0)
            {
                res.push_back(abs(nums[i]));
                nums[ind]=-nums[ind];
            }
        }
        return res;
    }
};