class Solution {
public:
int minNumberInRotateArray(vector<int> rotateArray) {
//空数组
if(rotateArray.size() == 0)
{
return 0;
}
//临时最小量
int minNum = rotateArray.at(0);
for(int i = 1; i < rotateArray.size(); i++)
{
if(rotateArray.at(i) < minNum)
{
minNum = rotateArray.at(i);
}
}
return minNum;
}
};
【JZ6】两个栈来实现一个队列
最新推荐文章于 2021-12-21 15:18:14 发布