448. Find All Numbers Disappeared in an Array
来源:互联网 发布:大学生网络安全意识 编辑:程序博客网 时间:2024/06/05 10:16
题目:
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]思路:
找缺失项,构建map容器遍历对比即可
代码:
class Solution {public: vector<int> findDisappearedNumbers(vector<int>& nums) { unordered_map<int,bool> mp; for(int j =0;j<nums.size();j++){ mp[nums[j]] = true; } vector<int> res; for(int i=0;i<nums.size();i++) { if(mp.find(i+1)==mp.end()) { res.push_back(i+1); } } return res; }};
阅读全文
0 0
- LeetCode-Array-448. Find All Numbers Disappeared in an Array
- [LC][Array] 448. Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- 448. Find All Numbers Disappeared in an Array
- 448. Find All Numbers Disappeared in an Array
- 448. Find All Numbers Disappeared in an Array
- leetcode:448. Find All Numbers Disappeared in an Array
- 网络字节序与主机字节序
- 求n!中因子m的个数
- ob_flush和flush的区别(包括buffer,flush等)
- 毛玻璃效果
- 了解Spring Data JPA
- 448. Find All Numbers Disappeared in an Array
- Android 与 Java 中的一些细节(笔记)
- 如果编程语言是女孩子……
- VMware虚拟机下的CentOS 设置静态IP【解决设置静态IP后不能上网的问题】
- Linux—I/O多路转接之epoll
- 六个案例,带你感受新零售服务市场的潜力
- Android内存优化(使用SparseArray和ArrayMap代替HashMap)
- (POJ
- 利用List接口的实现类ArrayList编写一个随机点名器