Leetcode——448. Find All Numbers Disappeared in an 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.

Example:

Input：[4,3,2,7,8,2,3,1]

Output: [5,6]

解题思路

使用元素的值就修改对应下标的元素，将对应下标的元素修改为对应的负数，即a = -a。修改元素值的代码段为nums[nums[i] -1] = -nums[nums[i]-1]。通过这种方式，所有遇到过的元素都变为负数，在第二次遍历的时候，找到为正数的数组下标，将下标值+1放到返回的List集合中。

AC代码

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> list = new ArrayList<Integer>();

        for(int i = 0; i < nums.length; i++) {
            int temp = Math.abs(nums[i]) - 1;
            if(nums[temp] > 0)
                nums[temp] = -nums[temp];
        }

        for(int i = 0; i < nums.length; i++) {
            if(nums[i] > 0)
                list.add(i+1);
        }
        return list;
    }
}

参考

https://discuss.leetcode.com/topic/65738/java-accepted-simple-solution