LeetCode7.2(Search Insert Position)

最新推荐文章于 2025-03-28 13:21:48 发布

原创最新推荐文章于 2025-03-28 13:21:48 发布 · 267 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode题解专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一种高效的方法，在已排序的数组中查找特定目标值的索引，或者确定如果该值被插入数组中，其应有的位置。通过递归的方式实现查找逻辑，确保了操作的准确性与效率。

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

        public static int solution_7_2(int[] nums,int target){
		return findIndex(nums,0,nums.length-1,target);
	}
	
	private static int findIndex(int[] nums,int low,int high,int target){
		if(low==high){
			if(nums[low]==target)
				return low;
			if(nums[low]<target)
				return low+1;
			if(nums[low]>target)
				return low;
		}
		if(low<high){
			int mid=(low+high)/2;
			if(nums[mid]==target)
				return mid;
			if(nums[mid]>target)
				return findIndex(nums, low, mid-1, target);
			if(nums[mid]<target)
				return findIndex(nums, mid+1, high, target);
		}
		return -1;
	}