- Leetcode 【442、1031】
- #442. Find All Duplicates in an
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
- 442. Find All Duplicates in an A
和448很像的一道题，比448还简单点，不知道这道题里的不用额外空间是什么情况，看别人的解法很多都用了的。
我的解法
class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
vector<int> output;
for (int i = 0; i < nums.size(); i ++){
if (nums[abs(nums[i]) - 1] < 0)
output.push_back(abs(nums[i]));
else{
nums[abs(nums[i]) - 1] = - nums[abs(nums[i]) - 1];
}
}
return output;
}
};
网友评论