LeetCode : Search Insert Position [java]
来源:互联网 发布:北京鹰目网络 编辑:程序博客网 时间:2024/04/30 05:51
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
思路:二分查找。
public class Solution { public int searchInsert(int[] nums, int target) {int left = 0;int right = nums.length - 1;int inserIndex = -1;while (left <= right) {int mid = (left + right) / 2;if (nums[mid] == target) {return mid;} else if (nums[mid] > target) {right = mid - 1;inserIndex = mid;} else {left = mid + 1;inserIndex = left;}}return inserIndex; }}
1 0
- [Leetcode] Search Insert Position (Java)
- [LeetCode][Java] Search Insert Position
- [LeetCode][Java] Search Insert Position
- leetcode:Search Insert Position 【Java 】
- LeetCode : Search Insert Position [java]
- Search Insert Position leetcode java
- LeetCode: Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- [LeetCode]Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode-Search Insert Position
- LeetCode - Search Insert Position
- LeetCode | Search Insert Position
- Leetcode: Search Insert Position
- java中String,StringBuffer,StringBuilder拼接效率对比
- 周记
- 使用getID3向.mp3文件写入ID3v2 TXXX标签
- sql 中 join的使用
- 80端口被pid=4的进程占用
- LeetCode : Search Insert Position [java]
- Kaggle(2):验证和过分拟合
- 关于aop环绕通知的几点理解
- 关于无法解析布局文件和id的问题
- Java集合小结(1)
- SoundPool与mediaPlayer的使用
- Codeforces Round #344 (Div. 2) A. Interview【水题】
- LeetCode 2.Add Two Numbers
- HDU 1040 As Easy As A+B