35. Search Insert Position(Java)
来源:互联网 发布:苹果6splus网络不稳定 编辑:程序博客网 时间:2024/06/09 16:02
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(int[] nums, int target) { int left = 0; int right = nums.length - 1; while (left <= right) { int mid = (left + right) / 2; if (nums[mid] == target) return mid; else if (nums[mid] < target) left = mid + 1; else right = mid - 1; } return left; }}
阅读全文
0 0
- 35. Search Insert Position(Java)
- Search Insert Position Java
- Search Insert Position (Java)
- (java) Search Insert Position
- (Java)LeetCode-35. Search Insert Position
- Leetcode[java] 35. Search Insert Position
- Leetcode 35. Search Insert Position (Medium) (java)
- [LeetCode-Java]35. Search Insert Position
- [leetcode]35. Search Insert Position(java)
- [leetcode]35. Search Insert Position(Java)
- 35. Search Insert Position —— Java
- 35.Search Insert Position
- 35. Search Insert Position
- 35.Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- idea控制台(output)乱码,代码乱码
- memset用法
- 母函数做的题
- PHP 安装SSH2扩展 Centos
- C++中的C_str()函数用法
- 35. Search Insert Position(Java)
- 网页的基础知识
- H3C笔试+面试
- iPhone X 插,看图求神评论
- js中区分对象与数组常用方法
- 翻译连载 | 第 9 章:递归(下)-《JavaScript轻量级函数式编程》 |《你不知道的JS》姊妹篇
- 已经在 stage 的文件再配置到 .gitignore 不生效
- Noip提高 2008 T3 传纸条 动态规划
- Hihocoder 1580 Matrix【思维+Dp+RMQ】