LeetCode 268. Missing Number

LC address: https://leetcode.com/problems/missing-number/

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

For example,
Given nums = [0, 1, 3] return 2.

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

Analysis:

换汤不换药的题目，XOR就能解决。

Solution:

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

Solution code can also be found here: https://github.com/all4win/LeetCode.git