LeetCode: 448. Find All Numbers Disappeared in an Array
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]
自己的答案,执行时间13ms:
public class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
int length = nums.length;
int[] bucket = new int[length];
for (int i = 0; i < length; i++) {
bucket[nums[i]-1]++;
}
List<Integer> result = new ArrayList<Integer>();
for (int i = 0; i < length; i++) {
if (bucket[i] == 0) {
result.add(i+1);
}
}
return result;
}
}
最快的答案,执行时间10ms:
public class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
int count[] = new int[nums.length+2];
List<Integer> ret = new ArrayList<Integer>();
int i;
for (i = 0; i < nums.length; i++)
{
count[nums[i]] = 1;
}
for(i = 1; i <= nums.length; i++)
{
if (count[i] == 0)
{
ret.add(i);
}
}
return ret;
}
}