Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<int> findDuplicates(vector<int>& nums) {
- int n = nums.size();
- for(int i=0;i<nums.size();i++)
- nums[i]--;
- for(int i=0;i<nums.size();i++)
- {
- nums[nums[i]%n]+=n;
- }
- vector<int> v;
- for(int i=0;i<n;i++)
- {
- if(nums[i]/n==2)
- v.push_back(i+1);
- }
- return v;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement