35. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

用二分查找就可以解决这个问题，稍微注意一下结束条件和最右边、最左边的取值

class Solution {
    public int searchInsert(int[] nums, int target) {
        int hight = nums.length - 1;
        int low = 0;
        int mid;
        
        while(low <= hight){
            
            mid = (low + hight) / 2;
            if(nums[mid] == target)
                return mid;
            else if(target > nums[mid])
                low = mid + 1;
            else hight = mid - 1;
        }
        
        return low;
    }
}