leetcode 之 Search Insert Position
2014-11-17 14:17
218 查看
问题:
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.
思路: binary search.
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.
class Solution { public: int searchInsert(int A[], int n, int target) { //binary search. int start = 0; int end = n-1; while ( start <= end) { int middle = (start + end) / 2; if(A[middle] == target) return middle; else if(A[middle] < target) start = middle + 1; else if(A[middle] > target) end = middle - 1; } return start; } };
相关文章推荐
- leetcode - 35.Search Insert Position
- [leetcode]Binary Search-35. Search Insert Position
- LeetCode 之 Search Insert Position
- leetcode之Search Insert Position
- LeetCode *** 35. Search Insert Position
- Leetcode: Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode(35)--Search Insert Position
- LeetCode Search Insert Position
- Search Insert Position - LeetCode
- Search Insert Position -LeetCode
- LeetCode 35. Search Insert Position
- LeetCode Search Insert Position查找插入位置
- LeetCode@Array_35_Search_Insert_Position
- [LeetCode] Search Insert Position
- [LeetCode] Search Insert Position
- Search Insert Position--LeetCode
- 35. Search Insert Position leetcode Python 2016 new season
- Leetcode: Search Insert Position
- Leetcode35: Search Insert Position