leetcode-448-Find All Numbers Disappeared in an Array
2017-04-26 21:57
423 查看
问题
题目:[leetcode-448]思路
这个题挺不错的,算是积累经验了。这类题都有一个一般的规律就是nums[i] = i + 1;
所以,主要是找他们和下标的关系。
这个题用的是对对应位置上的元素进行置位,如果一个数没有出现过,那么他对应下表位置上的元素就可以保证不修改。比如修改可以变为负数,打呢么第二次扫描的时候可以获得这些元素。
代码
class Solution { public: vector<int> findDisappearedNumbers(vector<int>& nums) { int sz = nums.size(); for(int i = 0; i < sz; ++i){ int idx = abs(nums[i]) - 1; nums[idx] = (nums[idx] > 0)?-nums[idx]:nums[idx]; } vector<int> ret; for(int i = 0; i < sz; ++i){ if( nums[i] > 0 ) ret.push_back(i+1); } return ret; } };
相关文章推荐
- LeetCode 448 Find All Numbers Disappeared in an Array
- leetcode(448). Find All Numbers Disappeared in an Array
- leetcode ---448---FindAllNumbersDisappearedinanArray
- 【LeetCode-448】 Find All Numbers Disappeared in an Array(C++)
- Leetcode 448 Find All Numbers Disappeared in an Array
- 【Leetcode-easy-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
- leetcode448 Find All Numbers Disappeared In An Array Java
- 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 C++
- LeetCode - 448 - Find All Numbers Disappeared in an Array
- Leetcode 448 Find All Numbers Disappeared in an Array
- LeetCode448 Find All Numbers Disappeared in an Array(java/python)
- 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
- Leetcode448 Find All Numbers Disappeared in an Array
- leetcode 448 Find All Numbers Disappeared in an Array