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]

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

         if (nums == null || nums.length == ) return list;

         for (int i = ; i < nums.length; i++) {
             int val = nums[i];
             if (nums[i] != -) {
                 nums[i] = -;
                 exchange(nums, val);
             }
         }

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

     public void exchange(int[] nums, int val) {
         if (nums[val - ] == val) return;

         int temp = nums[val - ];
         nums[val - ] = val;

         if (temp != -) {
             exchange(nums, temp);
         }
     }
 }

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

         if (nums == null || nums.length == )
             return list;

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

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