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?

Similar:

41. First Missing Positive

136. Single Number

287. Find the Duplicate Number

 1 public class Solution {
 2     public int missingNumber(int[] nums) {
 3         int xor = 0;
 4         for (int i = 0; i < nums.length; i++) {
 5             xor ^= i ^ nums[i];
 6         }
 7         xor ^= nums.length;
 8         return xor;
 9     }
10 }

268. Missing Number

标签：

原文地址：http://www.cnblogs.com/joycelee/p/5407726.html