剑指 Offer 53 - II. 0～n-1中缺失的数字

public int missingNumber(int[] nums) {
        int n = nums.length;
        int i = 0;
        while(i<n){
            if(nums[i]!=i) return i;
            else{
                i++;
            }
        }
        return n;
    }