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

class Solution {
    public int missingNumber(int[] nums) {
    
        int i = 0,j=nums.length-1;

        while (i<=j){
            int mid = (i+j)/2;

            if(nums[mid]==mid){
                i = mid + 1;
            }else{
                j = mid - 1;
            }

        }

        return i;
    }
}