Open larscheng opened 1 month ago
class Solution {
public int maxProfit(int[] prices) {
int min = Integer.MAX_VALUE;
int res = 0;
for (int price : prices) {
min = Math.min(min, price);
res = Math.max(res, price - min);
}
return res;
}
}
### 复杂度
- 时间复杂度:O(n)
- 空间复杂度:O(1)
121. 买卖股票的最佳时机