题意
题解
方法一:标志数组
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
vector<int> res;
int n = nums.size();
int flags[n];
memset(flags, 0, sizeof(int) * n);
for (int i = 0; i < n; i++) {
flags[nums[i] - 1] = 1;
}
for (int i = 0; i < n; i++) {
if (!flags[i]) res.push_back(i+1);
}
return res;
}
};
空间复杂度:O(n)
时间复杂度:O(n)
方法二:原地修改
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
int n = nums.size();
for (auto& num : nums) {
int x = (num - 1) % n;
nums[x] += n;
}
vector<int> ret;
for (int i = 0; i < n; i++) {
if (nums[i] <= n) {
ret.push_back(i + 1);
}
}
return ret;
}
};
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/solution/zhao-dao-suo-you-shu-zu-zhong-xiao-shi-d-mabl/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。