Leetcode 122. Best Time to Buy and Sell Stock II

zhangwj0101

于 2016-03-25 21:49:22 发布

阅读量194

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/zhangwj0101/article/details/50984219

Leetcode 专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一个在股票市场中通过多次买卖来最大化利润的算法。该算法允许无限次交易，但要求每次交易后必须卖出股票才能进行下一次购买。通过遍历价格数组并计算相邻元素之间的差值，此算法能够确定最佳交易时机，从而实现利润的最大化。

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

Question

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

Code

public int maxProfit(int[] prices) {
        int maxProfit = 0;

        int len = prices.length;
        for (int i = 1; i < len; i++) {
            int dif = prices[i] - prices[i - 1];

            if (dif > 0) {
                maxProfit += dif;
            }
        }

        return maxProfit;
    }