1.可以直接遍历
2.但是注意旋转数组的特性,这里可以用二分法,旋转数组前数组和后数组的分界线即为最小数字
class Solution
{
public int min(int[] arry)
{
int low = 0; int high = arry.Length - 1;
while (low < high)
{
int mid = low + (high - low) / 2;
if (arry[mid] > arry[high])
{
low = mid + 1;
}
else if (arry[mid] == arry[high])
{
high = high - 1;
}
else
{
high = mid;
}
}return arry[low];
}
}