35. Search Insert Position
2016-08-30 19:57
316 查看
二分查找,结束时left恰好停在比目标值大的index上,right恰好停在比目标值小的index上
class Solution { public: int searchInsert(vector<int>& nums, int target) { int n=nums.size(); int left=0,right=n-1; while(left<=right) { int mid=(left+right)>>1; if(nums[mid]==target) return mid; if(nums[mid]>target) right=mid-1; else left=mid+1; } return left; } };
相关文章推荐
- The Solution to Leetcode 35 Search Insert Position
- LeetCode 35 Search Insert Position
- 35、Search Insert Position
- 35. Search Insert Position
- 2018.04.02 leeycode 打卡 #35 . Search Insert Position
- LeetCode 35:Search Insert Position
- 35. Search Insert Position LeetCode
- LeetCode 35 Search Insert Position (C,C++,Java,Python)
- 35. Search Insert Position
- 35-m-Search Insert Position
- [leedcode 35] Search Insert Position
- leetcode - 35.Search Insert Position
- 35. Search Insert Position
- 35. 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