Best Time to Buy and Sell Stock II

最新推荐文章于 2026-01-07 21:40:30 发布

原创最新推荐文章于 2026-01-07 21:40:30 发布 · 386 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #算法

LeetCode 专栏收录该内容

111 篇文章

订阅专栏

本文介绍了一种用于计算股票交易中最大可能利润的算法。该算法允许进行多次买入和卖出操作，但每次卖出后才能再次购买。通过遍历价格数组并跟踪价格波动，可以有效地找出最佳买卖时机。

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 class Solution {
    public int maxProfit(int[] prices) {
        if(prices==null || prices.length<=1) return 0;
        int profit=0;
        int buy=prices[0];
        for(int i=1;i<prices.length;i++){
            if(prices[i]<prices[i-1]){
                profit+=prices[i-1]-buy;
                buy=prices[i];
            }
        }
        if(prices[prices.length-1]>buy) 
            profit+=(prices[prices.length-1]-buy);
        return profit;
    }
}