【LeetCode-154】Find Minimum in Rotated Sorted Array II
2016-04-06 09:28
525 查看
这道题和Find Minimum in Rotated Sorted Array(LeetCode-153)简直一模一样额,没区别,重复元素根本不影响的!
public class FindMinimuminRotatedSortedArray {
int result = Integer.MAX_VALUE;
public int findMin(int[] nums) {
binarySearch(nums, 0, nums.length - 1);
return result;
}
public void binarySearch(int[] nums,int left,int right){
if(left > right){
return;
}
if(nums[left] < nums[right]){
if(nums[left] < result){
result = nums[left];
}
return;
}
else{
int mid = left + (right - left) / 2;
if(nums[mid] < result){
result = nums[mid];
}
binarySearch(nums, left, mid - 1);
binarySearch(nums, mid + 1, right);
}
}
}
public class FindMinimuminRotatedSortedArray {
int result = Integer.MAX_VALUE;
public int findMin(int[] nums) {
binarySearch(nums, 0, nums.length - 1);
return result;
}
public void binarySearch(int[] nums,int left,int right){
if(left > right){
return;
}
if(nums[left] < nums[right]){
if(nums[left] < result){
result = nums[left];
}
return;
}
else{
int mid = left + (right - left) / 2;
if(nums[mid] < result){
result = nums[mid];
}
binarySearch(nums, left, mid - 1);
binarySearch(nums, mid + 1, right);
}
}
}
相关文章推荐
- java对世界各个时区(TimeZone)的通用转换处理方法(转载)
- java-注解annotation
- java-模拟tomcat服务器
- java-用HttpURLConnection发送Http请求.
- java-WEB中的监听器Lisener
- Android IPC进程间通讯机制
- Android Native 绘图方法
- Android java 与 javascript互访(相互调用)的方法例子
- 介绍一款信息管理系统的开源框架---jeecg
- 聚类算法之kmeans算法java版本
- java实现 PageRank算法
- PropertyChangeListener简单理解
- c++11 + SDL2 + ffmpeg +OpenAL + java = Android播放器
- 插入排序
- 冒泡排序
- 堆排序
- 快速排序
- 二叉查找树