35. 搜索插入位置

土豆丝炒土豆

已于 2022-11-26 15:17:19 修改

阅读量105

点赞数

分类专栏：数组文章标签：二分查找搜索插入升序数组 LeetCode 代码实现

于 2022-11-26 15:16:47 首次发布

本文链接：https://blog.csdn.net/yuzou____5000/article/details/128052359

版权

数组专栏收录该内容

9 篇文章 0 订阅

订阅专栏

https://leetcode.cn/problems/search-insert-position/description/

思路

nums 为无重复元素的升序排列数组，二分法

code

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int lens = nums.size();
        int left = 0;
        int right = lens-1;
        if(nums[left]>target) return 0;
        if(nums[right]<target) return lens;

        while(left<=right){
            int mid =(left+right)/2;
            if(nums[mid]== target) return mid;
            else if(nums[mid]<target) left = mid+1;
            else if(nums[mid]>target) right =mid-1;
        }
        return right+1;
    }
};