首页 > 代码库 > Leetcode 448. Find All Numbers Disappeared in an Array
Leetcode 448. Find All Numbers Disappeared in an Array
Leetcode 448. Find All Numbers Disappeared in an Array
Description Submission Solutions
- Total Accepted: 31266
- Total Submissions: 58997
- Difficulty: Easy
- Contributors: yuhaowang001
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input: [4,3,2,7,8,2,3,1] Output: [5,6]
Subscribe to see which companies asked this question.
题解：
（1）， 不能申请额外的空间， 只能在原数组进行swap操作了。
（2）， 根据数据的类型，大小都是处于 [1, n], 进行位置操作。
class Solution {
public:
vector<int> findDisappearedNumbers(vector<int>& nums) {
vector<int> ans;
int i = 0;
while(i<nums.size()){
if(nums[i] != nums[ nums[i]-1 ]){
swap(nums[i], nums[ nums[i]-1 ] );
}else{
++i;
}
}
for(int i=0; i<nums.size(); ++i){
if(nums[i] != i+1){
ans.push_back( i+1 );
}
}
return ans;
}
};
Leetcode 448. Find All Numbers Disappeared in an Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。