35. 搜索插入位置

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

class Solution {
    public int searchInsert(int[] nums, int target) {

        int right = nums.length-1;
        int left = 0;

        while(left<=right){

            int mid = (left+right)/2;

            if(target == nums[mid]){
                return mid;
            }

            if(target > nums[mid]){
                left = mid+1;
            }

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