leetcode :35. Search Insert Position

leetcode :35. Search Insert Position leetcode :35. Search Insert Position

原题链接

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