class Solution {public: int maxProfit(vector<int>& prices) {
int min=0;
if(prices.empty()) return 0;
for(int i=0;i<prices.size()-1;i++) {
for(int j=i+1;j<prices.size();j++)
{
if(prices[j]-prices[i]>min)
min=prices[j]-prices[i];
}
}
return min;
}
};
121
最新推荐文章于 2023-11-09 16:35:03 发布