leetcode每日一题-35:搜索插入位置

leetcode每日一题-35:搜索插入位置

链接

题目

分析

简单的二分查找,查询到结果后,判断对应位置的值即可,然后>=返回检索位置,反之,返回l+1

代码

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int l = 0, r = nums.size() - 1;
        while(l < r)
        {
            int mid = l + r >> 1;
            // 找到第一个大于等于target的值
            if(nums[mid] >= target) r = mid;
            else l = mid + 1;
        }

        if(target <= nums[l]) return l;
        else return l + 1; // 如果数组最大值都小于target那么插入数组的最后
    }
};

class Solution {
    
    
    public int searchInsert(int[] nums, int target) {
    
    
        int n = nums.length;
        int left = 0, right = n - 1, ans = n;
        while (left <= right) {
    
    
            int mid = ((right - left) >> 1) + left;
            if (target <= nums[mid]) {
    
    
                ans = mid;
                right = mid - 1;
            } else {
    
    
                left = mid + 1;
            }
        }
        return ans;
    }
}

作者：LeetCode-Solution