【LeetCode】448.Find All Numbers Disappeared in an Array
来源:互联网 发布:西南大学远程网络教育 编辑:程序博客网 时间:2024/06/05 17:27
【LeetCode】448.Find All Numbers Disappeared in an Array
tags: Array
题目地址:https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/#/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.
Examples:
Input:
[4,3,2,7,8,2,3,1]
Output:
[5,6]
Solutions:
正解:
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 i = 0; i < nums.length; i++) { if(nums[i] > 0) { ret.add(i+1); } } return ret; }}
思想就是说比如nums数组有8个数,那么数组为nums[0]~nums[7],里面的数为1~8,数减一之后一定有下标对应,将对应下标的数取相反数,那么遍历之后正数的下标加一则为数组中未出现的数。
Date:2017年6月2日
阅读全文
0 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)
- rel、href、src、url的区别
- Size_t
- day1
- Codeforces Round #417 (Div. 2) E. Sagheer and Apple Tree (树上尼姆博弈)
- Error:Content is not allowed in prolog.
- 【LeetCode】448.Find All Numbers Disappeared in an Array
- Spring-AOP
- python 导入selenium包(win7)
- 利用CVX工具箱实现多快拍采样的稀疏矩阵DOA估计(多快拍视为独立的若干个单快拍,结果求均值)
- Hrbust 1123 MST(最小生成树,Kruskal算法|Prim算法)
- 51 C语言if else语句
- 599. Minimum Index Sum of Two Lists
- win7安装Anaconda+TensorFlow
- angular2父子组件的数据传递,父组件向子组件传递数据