068. Find the insertion position -- binary search

---

One 、code

1.1 Title Description

Address

1.2 Answer key

class Solution {
     //  Two points search 
    public int searchInsert(int[] nums, int target) {
    
        int left = 0;
        int right = nums.length - 1;
        if(nums[left] > target) return 0;   // Left boundary 
        if(nums[right] < target) return nums.length; // Boundary 

        while(left <= right){
    
            int mid = left + (right - left) / 2;
            if(nums[mid] == target) return mid;

            if(nums[mid] > target){
    
                if(nums[mid - 1] < target){
    
                    return mid;
                }
                right = mid - 1;
            }else{
    
                left = mid + 1;
            }
        }
        return 0;
    }
}

Two 、 summary