class Solution {
public:
vector<int> findDuplicates(vector<int>& nums) {
int n = nums.size();
vector<int> ans;
for (int i = 0; i < n; i++) {
if (nums[abs(nums[i]) -1] < 0) {
ans.push_back(abs(nums[i]));
} else {
nums[abs(nums[i]) -1] *= -1;
}
}
return ans;
}
};
LeetCode C++ 442
最新推荐文章于 2024-07-19 21:09:58 发布