首页 > 代码库 > [LeetCode]153 Find Minimum in Rotated Sorted Array
[LeetCode]153 Find Minimum in Rotated Sorted Array
https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/
http://blog.csdn.net/linhuanmars/article/details/40449295
public class Solution {
public int findMin(int[] num) {
// Assume num is not null.
return find(num, 0, num.length - 1);
}
private int find(int[] n, int low, int high)
{
if (low == high)
return n[low];
if (high - low == 1)
return Math.min(n[low], n[high]);
int mid = low + (high - low) / 2;
if (n[low] < n[mid])
{
if (n[low] < n[high])
return find(n, low, mid);
else
return find(n, mid, high);
}
else
{
if (n[low] > n[high])
return find(n, low, mid);
else
return find(n, mid, high);
}
}
}[LeetCode]153 Find Minimum in Rotated Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。