Java [Leetcode 122]Best Time to Buy and Sell Stock II
题目描述:
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
解题思路:
遇到后天比前一天高的,就把差值相加,累计相加最后得到结果。
代码如下:
1 2 3 4 5 6 7 8 9 10 | public class Solution { public int maxProfit( int [] prices) { int res = 0 ; for ( int i = 0 ; i < prices.length - 1 ; i++){ if (prices[i] <= prices[i + 1 ]) res += (prices[i + 1 ] - prices[i]); } return res; } } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步