Search Insert Position--LeetCode
2015-03-30 11:26
323 查看
题目:
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
思路:使用二分查找
<pre name="code" class="cpp">#include <iostream> #include <vector> using namespace std; /* 在一个排好序的数组中找到一个元素合适的插入位置 可以使用二分查找的方式进行查找 */ int InsertPos(vector<int>& vec,int key) { int mid,begin=0,end = vec.size()-1; while(begin<=end) { mid = begin +( (end-begin)/2); if(vec[mid] == key) return mid; else if(vec[mid] < key) begin = mid+1; else end = mid-1; } return begin; } int main() { int array[]={1,8,9,12,15}; vector<int> vec(array,array+sizeof(array)/sizeof(int)); cout<<InsertPos(vec,100); return 0; }
思路:使用二分查找找到合适的位置,在二分查找如果找到这个数字,那么Mid就是这个位置,如果没有找到,那么最低位就是第一个大于这个数的数字。
int searchInsert(int A[],int n ,int target) { if(A == NULL) { return 0; } int l = 0; int r = n-1; while(l<=r) { int mid = (l+r)/2; if(A[mid]==target) return mid; if(A[mid]<target) l = mid+1; else r = mid-1; } return l; }
这是典型的在排好序的数组中查找一个值的下界,其实使用lower_bound是最合适的方法,这里只不过又实现了这个函数
相关文章推荐
- leetcode -- Search Insert Position
- LeetCode 35. Search Insert Position
- leetcode:Search Insert Position
- LeetCode 35. Search Insert Position
- leetcode:35. Search Insert Position
- LeetCode-35-Search Insert Position(搜素并插入指定位置)
- 【leetcode】35. Search Insert Position
- LEETCODE--Search Insert Position
- [leetcode] Search Insert Position
- SearchInsertPosition --leetcode
- leetcode 42: Search Insert Position
- LeetCode 35: Search Insert Position
- leetcode-Search Insert Position
- LeetCode:Search Insert Position
- LeetCode34:Search Insert Position
- [leetcode:python]35.Search Insert Position
- Leetcode: 35. Search Insert Position
- [LeetCode]—Search Insert Position 有序数组中找目标插入的位置
- 【题解】【数组】【查找】【Leetcode】Search Insert Position
- 【LeetCode】Search Insert Position搜索插入位置[数组、二分法] - Medium