利用折半查找在排序数组中查找值的下标，如果没有则返回插入下标

最新推荐文章于 2022-12-18 17:27:03 发布

FlyingApe

最新推荐文章于 2022-12-18 17:27:03 发布

阅读量992

点赞数

分类专栏： JAVA 文章标签： JAVA 算法

本文链接：https://blog.csdn.net/qq_35190319/article/details/86526411

版权

JAVA 专栏收录该内容

37 篇文章 1 订阅

订阅专栏

public class SearchInsertPosition {
	
	public int searchInsert(int[] nums, int target) {
		int low = 0,high = nums.length-1;
		while (low<=high) {
			int mid = (low+high)/2;
			if(nums[mid] == target)return mid;
			else if (nums[mid]<target) {
				low = mid+1;
			}else if (nums[mid]>target) {
				high = mid-1;
			}
		}
		return low;
		
    }
	public static void main(String[] args) {
		System.out.println(new SearchInsertPosition().searchInsert(new int[] {1,3,5,6},5));
		System.out.println(new SearchInsertPosition().searchInsert(new int[] {1,3,5,6},2));
		System.out.println(new SearchInsertPosition().searchInsert(new int[] {1,3,5,6},7));
		System.out.println(new SearchInsertPosition().searchInsert(new int[] {1,3,5,6},0));
		System.out.println(new SearchInsertPosition().searchInsert(new int[] {1,3},0));
	}
}

注：当找不到时，low就是要插入的位置！