int binarySearch(int[] nums, int target) {
int low = 0;
int high = nums.length;
while (low < high) {
        int mid = low + ((high - low) >> 1);
        if (target > nums[mid]) {
        　　low = mid + 1;
        } else {
            high = mid;
        }
    }
return low;
}