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.

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?

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

/**
 * @param {number[]} nums
 * @return {number}
 */
var missingNumber = function(nums) {
    var bitMap = [];
    for(var i = 0; i <= nums.length; i++) {
        bitMap[i] = 0;
    }
    for(var j = 0; j < nums.length; j++) {
        bitMap[nums[j]] = 1;
    }
    for(var k= 0; k <= nums.length; k++) {
       if(!bitMap[k]) {
           return k;
       } 
    }
    return nums.length + 1;
};

记一个在discuss里看到的解法，用的异或计算的性质，a XOR b XOR b = a

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