标签：rip esc logs question 元素 mod art list elements
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]题目大意是给定一个数组，最大值为n， n= size of array元素出现一次或两次，还有没有出现的，找到没有出现的元素。
class Solution { public List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> result = new ArrayList<Integer>(); for(int i = 0; i < nums.length; i++) { int tmp = Math.abs(nums[i]) - 1; //index if(nums[tmp] > 0) nums[tmp] = -nums[tmp]; } for(int i = 0;i < nums.length; i++) if(nums[i] > 0) l.add(i + 1); return result; } }
448. Find All Numbers Disappeared in an Array
标签：rip esc logs question 元素 mod art list elements
原文地址：http://www.cnblogs.com/wxshi/p/7598535.html
