LeetCode35 寻找插入的位置

最新推荐文章于 2025-08-23 14:20:42 发布

原创最新推荐文章于 2025-08-23 14:20:42 发布 · 83 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种在已排序数组中查找特定目标值插入位置的算法。该算法通过二分搜索的方式，当未找到目标值时，返回其在数组中应有的插入位置，确保数组的有序状态。适用于无重复元素的数组，示例包括了不同输入情况下的输出结果。

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2
Example 2:

Input: [1,3,5,6], 2
Output: 1
Example 3:

Input: [1,3,5,6], 7
Output: 4
Example 4:

Input: [1,3,5,6], 0
Output: 0

public int searchInsert(int[] nums, int target) {
        int l = 0;
        int r = nums.length;
        while(l < r){
            int mid = l + (r - l) / 2;
            if(nums[mid] == target) return mid;
            else if(nums[mid] > target) r = mid;
            else l = mid+1;
        }
        return l;
    }