« back

Find All Duplicates in an Array

Tags : array, leetcode, cpp, medium

Problem Statement - link #

Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice.

You must write an algorithm that runs in O(n) time and uses only constant extra space.

Examples #

Example 1:

Input: nums = [4,3,2,7,8,2,3,1]
Output: [2,3]

Example 2:

Input: nums = [1,1,2]
Output: [1]

Example 3:

Input: nums = [1]
Output: []

Constraints #

Solutions #

1 #

class Solution {
public:
    vector<int> findDuplicates(vector<int>& nums) {
        vector<int> mnk;
        sort(nums.begin(),nums.end());
        for(int i = 0; i < nums.size()-1; i++){
            if(nums[i] == nums[i+1]){
                mnk.push_back(nums[i]);
            }
        }
        return mnk;
    }
};

2 #

class Solution {
public:
    vector<int> findDuplicates(vector<int>& nums) {
        for(int num : nums)
        {
            int idx = abs(num) - 1;
            if(0 > nums[idx]) ans.push_back(idx+1);
            else    nums[idx] *= -1;
        }
        return ans;
    }
    private:
    vector<int> ans;
    
};