首页 > 代码库 > [Leetcode + Lintcode] 35. Search Insert Position
[Leetcode + Lintcode] 35. Search Insert Position
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
binary-search的变种，相当于找第一个大于等于target的element
1. java
public class Solution { public int searchInsert(int[] nums, int target) { if(nums == null || nums.length == 0){ return 0; } int start = 0; int end = nums.length - 1; while(start + 1 < end){ int mid = start + (end - start)/2; if(nums[mid] < target){ start = mid; } else if(nums[end] > target){ end = mid; } else{ return mid; } } if(nums[start] >= target){ return start; // nums[start] is the first element >= target } else if(nums[end] >= target){ return end; // nums[end] is the first element >= target } else{ return end+1; //nums[end] is the last element < target, should insert behind it } }}
2. python
class Solution: """ @param A : a list of integers @param target : an integer to be inserted @return : an integer """ def searchInsert(self, A, target): # write your code here if A is None or len(A) == 0: return 0 start = 0 end = len(A) - 1 while(start + 1 < end): mid = start + (end - start)/2 if A[mid] == target: return mid elif A[mid] < target: start = mid else: end = mid if A[start] >= target: return start elif A[end] >= target: return end else: return end+1
[Leetcode + Lintcode] 35. Search Insert Position
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。