排序之后输出最小的
#include <algorithm>
class Solution {
public:
int minNumberInRotateArray(vector<int> rotateArray) {
if(rotateArray.size()==0)
{
return 0;
}
sort(rotateArray.begin(),rotateArray.end());
return rotateArray.front();
}
};