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]

解题思路：
1.nums[i]-1的取值范围：0~n-1，代表了数组的下标
2.nums[nums[i]-1] = -nums[nums[i]-1]表示下标为nums[i]-1的位置有值
3.最后遍历数组找出nums[i]>0的位置，分别将i+1加入结果链表中

Language-Java，Time-O(n)，Space-O(1)，RunTime-19ms

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) //如果小于0说明这个位置已经被置为负数
            {
                nums[val] = -nums[val];
            }
        }
        for(int i = 0; i < nums.length; i ++)
        {
            if(nums[i] > 0)
            {
                ret.add(i + 1);
            }
        }
        return ret;
    }
}