0035. 搜索插入位置

[utterances-bot]

0035. 搜索插入位置 | 算法通关手册

https://algo.itcharge.cn/solutions/0001-0099/search-insert-position

[chuxiaoyu]

第6行ans=n没必要吧

[itcharge]

第6行ans=n没必要吧

感谢指正，已删除~~

[701Lee]

c++

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