Leetcode-448. Find All Numbers Disappeared in an Array

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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]

这个题目还是有点意思，如果没说有限制，我估计先遍历一遍，用一个set存储，然后再遍历一遍，如果不在set中则加到list中。 Your runtime beats 37.97% of java submissions.

public class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        for(int i = 0; i < nums.length; i ++){
            if(nums[i] != i + 1){
                if(nums[nums[i] - 1] != nums[i]){
                    int temp = nums[nums[i] - 1];
                    nums[nums[i] - 1] = nums[i];
                    nums[i] = temp;
                    i--;
                }
            }
        }
        List<Integer> result = new ArrayList<Integer>();
        for(int i = 0; i < nums.length; i ++){
            if(nums[i] != i + 1) result.add(i+1);
        }
        return result;
    }
}