35. Search Insert Position
2018-03-05 20:43
399 查看
在有序数组中寻找最恰当插入target的位置：对于在有序数组中查找元素，直接二分法。
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left=0,right=nums.size()-1;
int mid=(left+right)/2;
while(left<right)
{
if(nums[mid]<target)
left=mid+1;
if(nums[mid]>target)
right=mid-1;
if(nums[mid]==target)
return mid;
mid=(left+right)/2;
}
if(nums[left]<target)
return left+1;
else
return left;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 35. Search Insert Position
- 35. Search Insert Position
- LeetCode Problem 35:Search Insert Position
- LeetCode --- 35. Search Insert Position
- LeetCode 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
- The Solution to Leetcode 35 Search Insert Position
- Leetcode[35]-Search Insert Position
- LeetCode 35：Search Insert Position
- LeetCode 35 Search Insert Position
- 35 Search Insert Position
- 2018.04.02 leeycode 打卡 #35 . Search Insert Position
- 35. Search Insert Position
- [LeetCode]35 Search Insert Position
- LeetCode-35-Search Insert Position 裸lower_bound
- 【LEETCODE】35-Search Insert Position