***(leetcode) Search Insert Position
2014-09-29 09:23
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.
思路: 简单二分法查找,但是还是做了好几次。。。主要在插入节点位置上比较纠结,没有思考清楚。
通过二分查找,最后只会确定一个位置,target只会在这个元素的左侧或右侧!
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
思路: 简单二分法查找,但是还是做了好几次。。。主要在插入节点位置上比较纠结,没有思考清楚。
通过二分查找,最后只会确定一个位置,target只会在这个元素的左侧或右侧!
class Solution { public: int searchInsert(int A[], int n, int target) { int mid,left = 0 ,right = n-1; while(left<=right){ mid = (right+left)/2; if(A[mid] == target) return mid; else if(A[mid]> target) right = mid-1; else left = mid+1; } return left; } };
相关文章推荐
- [LeetCode] Search Insert Position
- leetcode之Search Insert Position
- leetcode-35-Search Insert Position
- 【leetcode】35. Search Insert Position
- LeetCode:35. Search Insert Position
- LeetCode | Search Insert Position(查找插入位置)
- leetcode 035 Search Insert Position
- 35. Search Insert Position LeetCode
- [Leetcode] 35 - Search Insert Position
- [LeetCode] Search Insert Position
- Leetcode c语言-Search Insert Position
- Search Insert Position leetcode java
- [leetcode] Search Insert Position
- 【LeetCode】35. Search Insert Position
- leetcode--search_insert_position
- Leetcode::Search Insert Position
- 【Leetcode】【Medium】Search Insert Position
- [LeetCode] 035. Search Insert Position (Medium) (C++)
- LeetCode:Search Insert Position
- Leetcode:search_insert_position