Leetcode 35 - Search Insert Position
来源:互联网 发布:股票盯盘系统公式 源码 编辑:程序博客网 时间:2024/06/18 05:21
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.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
思路:仍然是binary search。
class Solution {public: int searchInsert(vector<int>& nums, int target) { int left = 0; int right = nums.size()-1; int mid; //Binary Search while(left<=right){ mid = (left+right)/2; if(nums[mid]==target){ return mid; } if(nums[mid]>target){ right = mid-1; } if(nums[mid]<target){ left = mid+1; } } return left; }};
0 0
- 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
- 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
- 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
- LeetCode(35) Search Insert Position
- LeetCode 35: Search Insert Position
- Leetcode#35||Search Insert Position
- "生日悖论"补充
- ZOJ 1003 Crashing Balloon
- C++:泛型编程set(排序去重)
- 手机页面上body不随遮罩层上内容一起滚动
- C++简单例子说明一个问题
- Leetcode 35 - Search Insert Position
- iOS 绘图
- 线性规划(Matlab)丨线性规划问题与投资的收益和风险
- C++:泛型编程stack(括号匹配)
- 在visual studio 2013下使用Google Mock
- Educational Codeforces Round 6:(620)
- hdu2829Lawrence
- jxl读取Excel文件,dom4j写入xml文件例子
- 蓝桥杯:基础练习 十进制转十六制