LeetCode : Search Insert Position [java]
2016-03-10 23:46
615 查看
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.
5 → 2
2 → 1
7 → 4
思路:二分查找。
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; } }
相关文章推荐
- Java集合小结(1)
- java学习--异常
- 用 maven 下载 jar 文件以及 javadoc 和 sources
- Spring注入的反射解释
- 【java基础】多线程--生产者消费者--复习
- 怎么知道Java class文件JDK编译的版本号
- Java国际化程序
- 详解Java 类的初始化
- java中>>与>>>的区别
- java几个重要函数
- JDK动态代理
- JAVA线程
- LeetCode : Search for a Range [java]
- Eclipse快捷键大全
- Eclipse快捷键大全
- leetcode:Valid Palindrome 【Java】
- struts-dojo的使用
- struts2发送邮件
- SpringMVC的几种返回方式
- Spring3 MVC请求参数获取的几种方法