[leetcode-448-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]

思路:

The idea is very similar to problem 442. Find All Duplicates in an Array: https://leetcode.com/problems/find-all-duplicates-in-an-array/.

First iteration to negate values at position whose equal to values appear in array. Second iteration to collect all position whose value is positive,

which are the missing values. Complexity is O(n) Time and O(1) space.

vector<int> findDisappearedNumbers(vector<int>& nums)
     {
         int len = nums.size();
         for (int i = 0; i<len; i++) {
             int m = abs(nums[i]) - 1; // index start from 0
             nums[m] = nums[m]>0 ? -nums[m] : nums[m];
         }
         vector<int> res;
         for (int i = 0; i<len; i++) {
             if (nums[i] > 0) res.push_back(i + 1);
         }
         return res;
     }

参考:

https://discuss.leetcode.com/topic/65944/c-solution-o-1-space

转载于:https://www.cnblogs.com/hellowooorld/p/6846043.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值