Missing Number LT268

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

Example 1:

Input: [3,0,1]
Output: 2

Example 2:

Input: [9,6,4,2,3,5,7,0,1]
Output: 8

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

Idea 1. Bitwise operation, Xor, 0^x = x, 0^0 = 0, 0^1 = 1, Xor [0-N], the remaining number is the result.

Time complexity: O(N)

Space complexity: O(1)

class Solution {
    public int missingNumber(int[] nums) {
        int result = nums.length;
        for(int i = 0; i < nums.length; ++i) {
            result ^= (nums[i] ^ i);
        }
        return result;
    }
}

Idea 2. Math, the sum of sequencial numbers, sum[0...N] = (1+N)*N/2;

class Solution {
    public int missingNumber(int[] nums) {
        int N = nums.length;
        int result = (1+N) * N/2;
        for(int i = 0; i < nums.length; ++i) {
            result -= nums[i];
        }
        return result;
    }
}

Idea 3. Sort

Time complexity: O(NlgN)

Space complexity: O(1)

class Solution {
    public int missingNumber(int[] nums) {
        int N = nums.length;
        Arrays.sort(nums);
        if(nums[0] != 0) {
            return 0;
        }
        
        if(nums[N-1] != N) {
            return N;
        }
        
        for(int i = 1; i < nums.length; ++i) {
            if(nums[i] != i) {
                return i;
            }
        }
        return -1;
    }
}