题目链接:
力扣https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof/
【分析】一道简单的dp,要想利润最大,就要保留前面的最小值,枚举数组,如果当前值比最小值小那么替换最小值,否则做差和最终答案取最大。
class Solution {
public int maxProfit(int[] prices) {
int n = prices.length;
if(n == 0) return 0;
int max = 0;
int min = prices[0];
for(var i = 1; i < n; i++){
if(prices[i] > min){
max = Math.max(max, prices[i] - min);
}else if(prices[i] < min){
min = prices[i];
}
}
return max;
}
}