Leetcode 268: Missing Number

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

public class Solution {
    public int MissingNumber(int[] nums) {
        int n = nums.Length;
        
        for (int i = 0; i < nums.Length; i++)
        {
            n ^= i ^ nums[i];
        }
        
        return n;
    }
}