Search Insert Position
2015-04-02 02:14
162 查看
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.
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
class Solution { public: int searchInsert(int A[], int n, int target) { if (n < 1) { return 0; } int left = 0; int right = n - 1; while (left < right) { int mid = left + (right-left)/2; if (target == A[mid]) { return mid; } else if (target < A[mid]) { right = mid - 1; } else { left = mid + 1; } } if (target > A[left]) { return left + 1; } return left; } };
相关文章推荐
- leetcode-35- Search Insert Position
- [leetcode]35. Search Insert Position
- 【leetcode】【35】Search Insert Position
- [LeetCode35]Search Insert Position
- Search Insert Position
- Search Insert Position Leetcode 非二分查找法
- leetcode 35. Search Insert Position
- 35. Search Insert Position
- [LeetCode]Search Insert Position
- [Leetcode]Search Insert Position
- leetcode——Search Insert Position 二分查找 binary search
- LeetCode OJ Search Insert Position
- Search Insert Position
- LeetCode - 35. Search Insert Position
- [leetcode题后感]search insert position
- leetcode35: Search Insert Position
- Leetcode: Search Insert Position
- 35. Search Insert Position
- leetcode---search-insert-position---查找
- Search Insert Position