首页 > 代码库 > Find All Numbers Disappeared in an Array
Find All Numbers Disappeared in an Array
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]
正确的序列就藏在下标里。解法很巧妙，利用负号做标记。
class Solution { public: vector<int> findDisappearedNumbers(vector<int>& nums) { vector<int> temp; if (nums.size() == 0) return temp; unsigned int index = 0; for (int i = 0; i < nums.size(); i++) { index = abs(nums[i]) - 1; if (nums[index] > 0) nums[index] = 0 - nums[index]; } for (int i = 0; i < nums.size(); i ++) { if (nums[i] > 0) temp.push_back(i+1); } return temp; } };
Find All Numbers Disappeared in an Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。