LEETCODE: Best Time to Buy and Sell Stock II

原创于 2015-01-01 15:59:41 发布 · 268 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LEETCODE #算法 #遍历

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一种股票交易算法，允许在不同时段进行多次买卖操作，以最大化利润。通过分析每日股票价格，算法在价格上涨时买入并在价格下跌时卖出，从而实现利润最大化。

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

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 profits = 0;
        for(int ii = 1; ii < prices.size(); ii ++) {
            if(prices[ii] > prices[ii - 1]) {
                profits += prices[ii] - prices[ii - 1];
            }
        }
        return profits;
    }
};