Day2 LeetCode 力扣35 搜索插入位置

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

与二分查找相似，区别只是在没有目标元素时return的值不同