Leetcode 122: Best Time to Buy and Sell Stock II

最新推荐文章于 2024-11-13 11:37:20 发布

weixin_51401145

最新推荐文章于 2024-11-13 11:37:20 发布

阅读量107

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_51401145/article/details/116554912

版权

问题描述：

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

分析：
既然可以多次交易，则最大利益就是所有上升行情（第二天比第一天价格贵）的综合

代码如下：

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