[LeetCode] Search Insert Position
2014-10-26 20:56
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.
这里要考虑清楚为什么要返回left。
You may assume no duplicates in the array.
Here are few examples.
这里要考虑清楚为什么要返回left。
int findPos(int A[], int left, int right, int target) { if (left > right) return left; int mid = (left + right) /2; if (target > A[mid]) { return findPos(A, mid+1, right, target); } else if (target < A[mid]) { return findPos(A, left, mid-1, target); } else { return mid; } } int searchInsert(int A[], int n, int target) { if (n == 0) return 0; return findPos(A, 0, n-1, target); }
相关文章推荐
- leetcode -- Search Insert Position
- LeetCode 35. Search Insert Position
- leetcode:Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode—Search Insert Position
- leetcode:35. Search Insert Position
- LeetCode 118 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 有序数组中找目标插入的位置