[LeetCode] 35. Search Insert Position
来源:互联网 发布:apache教程 编辑:程序博客网 时间:2024/05/24 07:30
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
class Solution {public: int searchInsert(vector<int>& nums, int target) { int lo = 0, hi = nums.size() - 1; while (lo <= hi) { int mid = lo + (hi - lo) / 2; if (nums[mid] == target) return mid; else if (nums[mid] < target) lo = mid + 1; else hi = mid - 1; } return lo; }};
阅读全文
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
- 35. Search Insert Position LeetCode
- [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
- 整齐的表格
- 进制
- java判断完全平方数
- 读书笔记-真实的诸葛亮-1
- css属性
- [LeetCode] 35. Search Insert Position
- 前自增的学习和自我探讨
- 授权MySQL数据库远程连接的权限
- python写算法题:leetcode: 30. Substring with Concatenation of All Words
- 图论——calling circls
- c语言基础——运算符表达式
- 【转】SPSS与EXCEL的比较
- 在windows上面建立端口传文件
- ReactNative获取ListView当前界面展示的row的个数