268. Missing Number

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

For example,

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

 Note:

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

    题目就是求从0到n中，有哪一个数字没有。当为[0]时，输出为1.题目的第一眼看的时候就想用桶排序的方法。求出来了，不过估计不是很好的，看了一下别人的，都用的很巧妙。大家可以作为参考，具体的代码如下：

public class Solution {

   public int missingNumber(int[] nums) {

       Arrays.sort(nums);

                  int length=nums.length;

                   if(length==0)return 0;

        

                   intmax=nums[length-1];

                   int[]sum=new int[max+1];

                   for(inti=0;i<length;i++){

                            sum[nums[i]]++;

                   }

                   for(inti=0;i<=max;i++){

                            if(sum[i]==0)

                                     returni;

                   }

                   returnmax+1;

    }

}

方法二：

public static int missingNumber(int[] nums){

   int sum = nums.length;

   for (int i = 0; i < nums.length; i++)

       sum += i - nums[i];

   return sum;

}