没想到是简单粗暴的用贪心算法,我真是太年轻了。
问题连接:https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/22/
代码:
public int maxProfit(int[] prices) {
int len=prices.length;
int result = 0;
for(int i=0;i+1<len;i++) {
if(prices[i+1]>prices[i]){
result+=prices[i+1]-prices[i];
}
}
return result;
}