Java for LeetCode 154 Find Minimum in Rotated Sorted Array II
2015-06-05 16:49
711 查看
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e.,
Find the minimum element.
The array may contain duplicates.
解题思路:
参考Java for LeetCode 081 Search in Rotated Sorted Array II JAVA实现如下:
(i.e.,
0 1 2 4 5 6 7might become
4 5 6 7 0 1 2).
Find the minimum element.
The array may contain duplicates.
解题思路:
参考Java for LeetCode 081 Search in Rotated Sorted Array II JAVA实现如下:
public int findMin(int[] nums) { int left = 0, right = nums.length - 1, res = nums[0]; while (left <= right) { res = Math.min(nums[left],Math.min(res, nums[(right + left) / 2])); if (nums[(right + left) / 2] < nums[left]) right = (right + left) / 2 - 1; else if (nums[(right + left) / 2] > nums[left]) left = (right + left) / 2 + 1; else left++; } return res; }
相关文章推荐
- Java Word 转 Pdf
- JAVA设计模式初探之组合模式
- 简易Java(18):属性能否重写?为什么?
- 在java类中执行main方法时,报内存溢出
- netbeans下将所有jar包打成一个,俗称fat jar
- Struts2开发步骤
- 疯狂Java学习笔记(74)------------线程池
- Eclipse基于注解方式搭建ssh框架
- Eclipse 快捷键
- Struts2的安装
- java之链表反转
- 《Java从入门到精通》第三章学习笔记
- org.springframework.web.context.request.RequestContextListener
- java 模式
- Spring整合Hibernate,使用注解,报错can't find hbm.cfg.xml
- Android 获取签名证书的详细信息(Eclipse和Android studio通用)
- java 科学计数法转换
- 【Eclipse使用教程】Eclipse快捷键你知多少?
- Java for LeetCode 153 Find Minimum in Rotated Sorted Array
- eclipse Failed to create the part's controls 解决方法