[leetcode] Best Time to Buy and Sell Stock II

最新推荐文章于 2023-02-28 14:37:52 发布

原创最新推荐文章于 2023-02-28 14:37:52 发布 · 323 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一种在股票市场上通过频繁交易获取最大利润的算法。该算法允许在任意次数的买卖中获利，但禁止同时进行多笔交易。通过分析股票价格序列，算法能够识别出买入和卖出的最佳时机，实现最大化的投资回报。

From : https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

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

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int profit=0;
        for(int i=1,days=prices.size(); i<days; i++) {
            if(prices[i] > prices[i-1]) profit = profit+prices[i]-prices[i-1];
        }
        return profit;
        
    }
};