LeetCode_ 35 (search insertion position)

Title Description ：
Given a sort array and a target value , Find the target value in the array , And return its index . If the target value does not exist in the array , Return to where it will be inserted in sequence .

Please use a time complexity of O(log n) The algorithm of .

Example 1:
Input : nums = [1,3,5,6], target = 5
Output : 2

Example 2:
Input : nums = [1,3,5,6], target = 2
Output : 1

Example 3:
Input : nums = [1,3,5,6], target = 7
Output : 4

Tips :
1 <= nums.length <= 104
-104 <= nums[i] <= 104 nums by No repeating elements Of Ascending Arrange arrays
-104 <= target <= 104

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