class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.empty()) return 0;
int min_price = prices[0];
int result = 0;
for (int i = 1; i < prices.size(); ++i) {
min_price = min(min_price, prices[i]);
result = max(result, prices[i]-min_price);
}
return result;
}
};
- AC
- 8ms
- beat 33.03%