122. Best Time to Buy and Sell Stock II Java

最新推荐文章于 2020-04-15 14:44:24 发布

0_o_c

最新推荐文章于 2020-04-15 14:44:24 发布

阅读量443

点赞数

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

本文链接：https://blog.youkuaiyun.com/tzh476/article/details/52429821

版权

leetcode 专栏收录该内容

58 篇文章

订阅专栏

本文介绍了一种计算股票交易最大利润的算法。该算法允许进行多次买卖操作，但每次卖出后才能再次购买。通过分析股票价格序列，算法能确定最佳买卖时机以最大化总利润。

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

1、题目：点击打开链接

2、题目：

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

3、代码：

public class Solution {
    public int maxProfit(int[] prices) {
        int i,sum=0;
        for(i=0;i<prices.length-1;i++){
            if(prices[i]<prices[i+1]){
                sum=sum+prices[i+1]-prices[i];
            }
        }
        return sum;
    }
}