leetCode-Find All Numbers Disappeared in an Array
来源:互联网 发布:银行软件开发招聘 编辑:程序博客网 时间:2024/05/29 09:21
Description:
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]
My Solution:
class Solution { public List<Integer> findDisappearedNumbers(int[] nums) { int len1 = nums.length; Set<Integer> set = new HashSet<Integer>(); Set<Integer> set1 = new HashSet<Integer>(); for(int i = 0;i < len1;i++){ set.add(Integer.valueOf(i + 1)); set1.add(Integer.valueOf(nums[i])); } set.removeAll(set1); return new ArrayList<Integer>(set); }}
Another Better Solution:
public class Solution { public List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> list = new ArrayList<>(); boolean[] a = new boolean[nums.length + 1]; for(int i = 0; i < nums.length; i++) { a[nums[i]] = true; } for(int i = 1; i < a.length; i++) { if(!a[i]){ list.add(i); } } return list; }}
总结:建立一个boolean数组,对应下标为true表示数值存在,false表示不存在,遍历nums,将nums值作为下标,赋为true。遍历boolean数组,为false值的下标即为不存在,添加到ArrayList即可(注意,boolean数组的长度为nums的长度加一,方便一一对应)。
重要的是要观察到nums值与即为boolean数组下标。
阅读全文
0 0
- leetcode 448Find All Numbers Disappeared in an Array (array)
- LeetCode-Array-448. Find All Numbers Disappeared in an Array
- LeetCode OJ|Array|Find All Numbers Disappeared in an Array
- LeetCode OJ|Array| Find All Numbers Disappeared in an Array
- LeetCode刷题【Array】 Find All Numbers Disappeared in an Array
- [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 No.448 Find All Numbers Disappeared in an Array
- LeetCode Find All Numbers Disappeared in an Array
- <leetcode>448.Find All Numbers Disappeared in an Array
- leetcode: Find All Numbers Disappeared in an Array
- leetcode-448 Find All Numbers Disappeared in an Array
- [LeetCode]Find All Numbers Disappeared in an Array
- [LeetCode] 448. Find All Numbers Disappeared in an Array
- [Leetcode] 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 C++
- tensorflow基础--Regression
- 16 STL集合和映射容器set/multiset_map/multimap(学自Boolean)
- scrapy 安装
- Unity FPS帧率计算
- BZOJ2005 [Noi2010]能量采集 递推+容斥/欧拉函数
- leetCode-Find All Numbers Disappeared in an Array
- 解析json总结备用
- Linux下安装JDK的三种方法
- kindeditor编辑器和图片上传独立分开的配置细节(转载)
- TCP socket通信粘包分析及解决思路
- 【MATH】TJOI2015 BZOJ4001 LGP3978 概率论
- 关于SteamVR插件内置的交互系统InteractionSystem
- 手册
- 文章标题