[Leetcode]Search Insert Position
2015-03-15 00:23
357 查看
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.
典型的二分查找问题,注意越界了的返回值就好了。
You may assume no duplicates in the array.
典型的二分查找问题,注意越界了的返回值就好了。
class Solution { public: int searchInsert(int A[], int n, int target) { int low=0;int high=n-1; while(low<=high){ int mid=(low+high)>>1; if(target==A[mid]) return mid; if(target<A[mid]) high=mid-1; else low=mid+1; } if(high<0) return 0; if(low>n) return n; return low; } };
相关文章推荐
- Leetcode 35. Search Insert Position (Medium) (cpp)
- leetcode——Search Insert Position
- Java for LeetCode 035 Search Insert Position
- leetcode — search-insert-position
- LeetCode Search Insert Position查找插入位置
- LeetCode 35 Search Insert Position(插入排序)
- [leetcode][search] Search Insert Position
- [LeetCode] Search Insert Position
- [LeetCode] Search Insert Position
- [leetcode]35. Search Insert Position
- <LeetCode OJ> 35. Search Insert Position
- leetcode笔记:Search Insert Position
- [leetcode]: 35. Search Insert Position
- leetcode-35 Search Insert Position
- leetcode解题方案--035--Search Insert Position
- Leetcode: Search Insert Position
- LeetCode-35-Search Insert Position(二分法)-Medium
- LeetCode 35. Search Insert Position
- [Leetcode]_35 Search Insert Position
- [LeetCode] Search Insert Position