[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?

 

思路：蛮水的这题。。。但是还是随便写写。需要注意的是给你的数组并非按顺序排的。所以一开始先排序下。。

class Solution {
    public int missingNumber(int[] nums) {
        Arrays.sort(nums);
        int i;
        for (i=0;i<nums.length;i++){
            if (i!=nums[i])
                break;
        }
        return i;
    }
}