448. 找到所有数组中消失的数字

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        //染色法，将每个索引i代表i+1的值是否有
        for (int i = 0; i < nums.length; i++) {
            int curr=Math.abs(nums[i]);
            int index=curr-1;
            if (nums[index]>0){
                nums[index]=-nums[index];
            }
        }

        List<Integer> res=new LinkedList<>();
        for (int i = 0; i < nums.length; i++) {
            if (nums[i]>0){
                res.add(i+1);
            }
        }
        return res;
    }
}