[LeetCode] Search Insert Position
2013-11-09 22:35
375 查看
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) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each test case. int left = 0, right = n - 1, mid = 0; if(target < A[left]) return 0; if(target > A[right]) return n; while(true) { if(target == A[left]) return left; if(target == A[right]) return right; if(right == left + 1) return right; mid = (left + right) / 2; if(target == A[mid]) return mid; else if(target < A[mid]) right = mid; else left = mid; } } };
相关文章推荐
- LeetCode 34. Search Insert Position
- Search Insert Position--LeetCode
- [LeetCode]problem 35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode 35 Search Insert Position 二叉查找相关(一)
- [leetcode] 35. Search Insert Position
- [Leetcode] 35. Search Insert Position
- [leetcode]35. Search Insert Position(Java)
- 【LeetCode35】【Search Insert Position】二分法查找
- Leetcode Search Insert Position解题报告
- Leetcode Search Insert Position
- LeetCode35. Search Insert Position
- 【题解】【数组】【查找】【Leetcode】Search Insert Position
- leetcode - Search Insert Position
- LeetCode 35 — Search Insert Position(C++ Java Python)
- [LeetCode] Search Insert Position 二分搜索
- Search Insert Position leetcode java
- LeetCode(34)SearchInsertPosition
- 【leetcode】35. Search Insert Position
- leetcode: Search Insert Position