35. 搜索插入位置

35. 搜索插入位置

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