public class Solution {
public int maxProfit(int[] prices) {
if(prices.length==0) return 0;
int max=0;
for(int i=0;i<prices.length-1;i++){
if(prices[i+1]>prices[i]) max+=prices[i+1]-prices[i];
}
return max;
}
}
122. Best Time to Buy and Sell Stock II
最后编辑于 ：
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门，熙熙楼的掌柜王于贵愁眉苦脸地迎上来，“玉大人，你说我怎么就摊上这事。” “怎么了？”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着，像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上，一...
- 文/苍兰香墨 我猛地睁开眼，长吁一口气：“原来是场噩梦啊……” “哼！你这毒妇竟也来了？” 一声冷哼从身侧响起，我...
推荐阅读更多精彩内容
- Say you have an array for which the ith element is the pr...
- Problem Say you have an array for which the ith element i...
- Say you have an array for which the i thelement is the pr...
- Say you have an array for which the ith element is the pr...
