class Solution:
def minNumberInRotateArray(self, rotateArray):
# write code here
return min(rotateArray)
class Solution {
public:
int minNumberInRotateArray(vector<int> rotateArray)
{
if (rotateArray.size() > 0)
{
int low, high, middle;
low = 0;
high = rotateArray.size() - 1;
middle = low;
// 结束条件
while (rotateArray[low] >= rotateArray[high])
{
// 结束条件
if (high - low == 1)
{
middle = high;
break;
}
// 求取中间的索引值
middle = (low + high) / 2;
// 判断中间值的大小, 知道它是前面的递增序列还是后面的递增序列
if (rotateArray[middle] <= rotateArray[high])
{
high = middle;
}
else if (rotateArray[middle] >= rotateArray[low])
{
low = middle;
}
}
return rotateArray[middle];
}
return 0;
}
};