LeetCode 448. Find All Numbers Disappeared in an Array
来源:互联网 发布:广州小孩学编程 编辑:程序博客网 时间:2024/05/21 17:02
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]
分析:hash[i]用来标记i是否在nums数组中出现过。然后将没有出现过的放入result数组中,返回result数组~~~
class Solution {public: vector<int> findDisappearedNumbers(vector<int>& nums) { vector<int> result; vector<bool> hash(nums.size() + 1, false); for(int i = 0; i < nums.size(); i++) { hash[nums[i]] = true; } for(int i = 1; i < hash.size(); i++) { if(hash[i] == false) result.push_back(i); } return result; }};
1 0
- LeetCode-Array-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
- <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
- 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
- 448. [LeetCode]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
- 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
- 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(Java)
- 【WPF】MVVM前台绑定一组RadioButton按钮
- CVE-2016-7200&7201源码分析
- Leetcode-53. Maximum Subarray
- 根据图片url写入图片到制定位置
- arukas 的 Endpoint
- LeetCode 448. Find All Numbers Disappeared in an Array
- 2.系统开发基础-软件开发方法(2)
- CONCAT(字符串连接函数)和GROUP_CONCAT的一个例子
- 栈的解析及C++实现
- Python NLTK 学习笔记1
- Android中点击事件的4中写法
- 桶排序(bucket sort)
- 路由配置与管理——ISIS路由配置与管理3
- java socket简易聊天室