Search Insert Position

最新推荐文章于 2023-05-31 00:05:53 发布

smallfish_yy

最新推荐文章于 2023-05-31 00:05:53 发布

阅读量348

点赞数

CC 4.0 BY-SA版权

分类专栏： sorting LeetCode

本文链接：https://blog.youkuaiyun.com/smallfish_yy/article/details/18262755

LeetCode 同时被 2 个专栏收录

101 篇文章

订阅专栏

sorting

13 篇文章

订阅专栏

本文介绍了一种使用二分查找法来确定目标值在有序数组中的插入位置的方法。该算法适用于不含重复元素的情况，并提供了特殊情况的处理方式。通过几个实例展示了如何在不同情况下找到正确的插入位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

Analysis: Applied generalized binary search to find the upper bound of the target. The special case that needs to be handled for this algorithm is that the value of target is greater than the value of the last element of array A.

public class Solution {
    public int searchInsert(int[] A, int target) {
        if(A.length==0) return 0;
        if(target>A[A.length-1]) return A.length;
        
		int low=0, high=A.length-1;
		while(low < high) {
			int mid = (low+high)/2;
			if(target==A[mid]) return mid;
			else if(target>A[mid]) low=mid+1;
			else if(target<A[mid]) high=mid;
		}
		return high;
    }
}