448. Find All Numbers Disappeared in an Array
来源:互联网 发布:mac .git文件夹 编辑:程序博客网 时间:2024/05/16 00:44
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是数组长度),同时给了复杂度限制o(n)和空间限制no extra。
思路是让 nums[nums[i] - 1] 取反,再判断 nums[] 大于零的元素即可实现。为什么不是 nums[nums[i]] ?因为 nums[nums[i]] 有可能越界。
代码如下:
public class Solution { public List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> ret = new ArrayList<Integer>(); for (int i = 0; i < nums.length; i++) { int val = Math.abs(nums[i]) - 1; if (nums[val] > 0) { nums[val] = -nums[val]; } } for (int j = 0; j < nums.length; j ++) { if (nums[j] > 0) { ret.add(j + 1); } } return ret; }}
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
- TEC1701.WebADI开发技术总结 - 第三章 Step3 - 配置Web ADI(3/6)
- fatal error: QWebView: No such file or directory
- Shadowsocks:从网段1转接到网段2
- react 应用实例1 setState触发重绘
- 支持向量机:从基础到前沿(一:引言)
- 448. Find All Numbers Disappeared in an Array
- 一行代码解决百度分享无法动态传递参数问题
- Leetcode 297. Serialize and Deserialize Binary Tree (Hard) (cpp)
- IO BufferedInputStream
- IO BufferedOutputStream
- Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)
- exercise 5 多变量
- 使用buffer拷贝文件
- 169. Majority Element