LeetCode——Search Insert Position
2014-11-18 21:07
232 查看
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
Java代码:
public class Solution {
public int searchInsert(int[] A, int target) {
int len = A.length;
int start =0;
int end = len-1;
int index =0;
for(;;)
{
if(start ==end)
{
if(A[end]<target)return end+1;
else return end;
}
index=(start+end)/2;
if(A[index]<target)
{
start = index+1;
}
else if(A[index]>target){
end =index;
}
else{
return index;
}
}
}
}
相关文章推荐
- LeetCode:Search Insert Position
- 【leetcode】Array——Search Insert Position(35)
- [LeetCode][Java] Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode - Search Insert Position
- LeetCode Search Insert Position
- Leetcode_Search Insert Position
- 【LeetCode】Search Insert Position
- leetcode-35 Search Insert Position
- LeetCode: Search Insert Position
- *LeetCode Search Insert Position -- lower_bound
- 【leetcode】Search Insert Position
- [LeetCode 35] Search Insert Position Solution
- leetcode(35) - Search Insert Position
- [Leetcode]Search Insert Position
- LeetCode - 35. Search Insert Position
- [LeetCode] Search Insert Position
- leetcode — search-insert-position
- [LeetCode] Search Insert Position
- 【LeetCode】C# 35、Search Insert Position