【leetcode】Search Insert Position
2015-04-10 18:46
316 查看
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
普通方法,时间复杂度为O(n)
二分法,时间复杂度为O(logn)
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
普通方法,时间复杂度为O(n)
class Solution { public: int searchInsert(int A[], int n, int target) { if(n==0) return NULL; int i=0; for(i=0;i<n;i++) { if(target<=A[i]) return i; } return i; } };
二分法,时间复杂度为O(logn)
class Solution { public: int searchInsert(int A[], int n, int target) { int start=0; int end=n-1; int index=(start+end)/2; while(start<end) { if(A[index]>target) { end=index-1; index=(start+end)/2; }else if(A[index]<target){ start=index+1; index=(start+end)/2; }else{ return index; } } if(A[start]<target){ return start+1; }else{ return start; } } };
相关文章推荐
- 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 Search Insert Position -- lower_bound
- [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】C# 35、Search Insert Position
- [LeetCode][Java] Search Insert Position
- LeetCode 35. Search Insert Position(查找插入位置)
- leetcode-二分搜索:Search Insert Position
- python实现 LeetCode35——Search Insert Position