35. Search Insert Position
2016-07-14 21:46
232 查看
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.
Subscribe to see which companies asked this question
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
Subscribe to see which companies asked this question
class Solution { public: int searchInsert(vector<int>& nums, int target) { if(nums.size()==0 || nums[0]>=target) return 0; if(nums[nums.size()-1]<target) return nums.size(); int left=0; int right=nums.size(); while(left<right) { int mid=(right-left)/2+left; if(target>nums[mid]) left=mid+1; else right=mid; } return left; } };
相关文章推荐
- tungsten-replicator问题与解决方法
- 编程中遇到的因脑残造成的错误--struts2(2016/7/14)
- 排序
- 网络通信框架Apache MINA
- POJ2349 UVa10369题解
- map的使用
- [Leetcode]374. Guess Number Higher or Lower
- python2.7和python3.4共存
- Linux网络编程入门-3
- A/B测试五大注意事项
- canvas绘制中国国旗
- GNU Octave - 开放源代码科学计算及数值分析的工具
- SMS_SDK之短信验证
- 第十一章 线程
- 穷举法:填运算符游戏
- 长沙面试总结
- [精]Oracle 数据库启动阶段详解
- java异常处理
- 后端服务器nginx.conf
- QT学习之-HelloWorld