LeetCode——Best Time to Buy and Sell Stock II

最新推荐文章于 2025-07-23 13:59:28 发布

Brittany爱编程

最新推荐文章于 2025-07-23 13:59:28 发布

阅读量478

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode algorithm

本文链接：https://blog.youkuaiyun.com/jjting/article/details/38456899

LeetCode 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种计算股票交易最大利润的算法。该算法允许进行多次买卖操作，但每次卖出后才能再次购买。通过遍历价格数组并抓住每一次上涨机会来累计最大利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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).

public int maxProfit(int[] prices) {
		int profit = 0, start = prices[0];
//Solution1: 寻找最多的递增子序列，利润加总
//		for(int i=1; i<prices.length; i++) {
//			if(prices[i] > prices[i-1]) {
//				continue;
//			}
//			
//			profit += prices[i-1] - start;
//			start = prices[i];
//		}
//		
//		profit += prices[prices.length - 1] - start;
		
//Solution2
		for(int i=1; i<prices.length; i++) {
			if(prices[i] > prices[i-1]) {
				profit += prices[i] - prices[i-1];
			}
		}
		return profit;
	}