<easy>LeetCode Problem -- 448. Find All Numbers Disappeared in an Array
2018-02-01 18:26
417 查看
描述: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]
分析:要求找到数组元素为1-n长度为n的数组中为出现的元素。
思路一:采用标记法,存在数字的位置的值置为负数,如果最后值为正数则代表这个数没有出现过。
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]
分析:要求找到数组元素为1-n长度为n的数组中为出现的元素。
思路一:采用标记法,存在数字的位置的值置为负数,如果最后值为正数则代表这个数没有出现过。
class Solution { public: vector<int> findDisappearedNumbers(vector<int>& nums) { vector<int> res; for (int i = 0; i < nums.size(); i++) { nums[abs(nums[i]) - 1] = -abs(nums[abs(nums[i]) - 1]); } for (int i = 0; i < nums.size(); i++) { if (nums[i] > 0) res.push_back(i + 1); } return res; } };
相关文章推荐
- <easy>LeetCode Problem -- 219. Contains Duplicate II
- <easy>LeetCode Problem -- 561. Array Partition I
- <easy>LeetCode Problem -- 661. Image Smoother
- <easy>LeetCode Problem -- 655. Print Binary Tree
- <easy>LeetCode Problem -- 283. Move Zeroes
- <easy>LeetCode Problem -- 404. Sum of Left Leaves
- <easy>LeetCode Problem -- 674. Longest Continuous Increasing Subsequence
- <easy>LeetCode Problem -- 617. Merge Two Binary Trees
- <easy>LeetCode Problem -- 268. Missing Number
- <easy>LeetCode Problem -- 566. Reshape the Matrix
- <easy>LeetCode Problem -- 27. Remove Element
- <easy>LeetCode Problem -- 766. Toeplitz Matrix
- <easy>LeetCode Problem -- 669. Trim a Binary Search Tree
- <easy>LeetCode Problem -- 637. Average of Levels in Binary Tree
- <easy>LeetCode Problem -- 563. Binary Tree Tilt
- <easy>LeetCode Problem -- 217. Contains Duplicate
- <easy>LeetCode Problem -- 606. Construct String from Binary Tree
- <easy>LeetCode Problem -- 167. Two Sum II - Input array is sorted
- <medium>LeetCode Problem -- 287. Find the Duplicate Number
- <medium>LeetCode Problem -- 144. Binary Tree Preorder Traversal