35、Search Insert Position
2015-01-26 21:38
274 查看
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.
Array Binary
Search
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
Array Binary
Search
int searchInsert(int A[], int n, int target) { //此题比较简单,顺序遍历是好的,但是对于有序数组来说,我们尝试使用二分搜索 int low = 0, high = n, mid; while (low < high) { mid = (low + high) / 2; if (A[mid] >= target) high = mid; else low = mid + 1; } if (A[mid] >= target) return mid; else return mid + 1; }
相关文章推荐
- 35. Search Insert Position
- [leetcode]-35. Search Insert Position(C语言)
- 2018.04.02 leeycode 打卡 #35 . Search Insert Position
- Leetcode35: Search Insert Position
- 35. Search Insert Position
- LeetCode:35. Search Insert Position
- LeetCode(35) Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- [leetcode-查找]--35. Search Insert Position
- LeetCode - 35. Search Insert Position
- leetcode35. Search Insert Position
- 35 Search Insert Position
- leetcode-- 35. Search Insert Position
- LeetCode 35: Search Insert Position
- LeetCode 35 — Search Insert Position(C++ Java Python)
- LeetCode 35 Search Insert Position(插入排序)
- [leetcode]: 35. Search Insert Position
- 35 Search Insert Position
- 2018.04.02 leeycode 打卡 #35 . Search Insert Position