LeetCode Best Time to Buy and Sell Stock II

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种无限次买卖股票的交易策略，通过分析每日股票价格，设计算法实现最大利润。该策略允许在任意一天卖出股票后立即在同一天买入，但要求在进行下一次交易前必须先卖出。

Best Time to Buy and Sell Stock II Total Accepted: 41127 Total Submissions: 108434 My Submissions Question Solution
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) {
        if(prices.size()==0)
            return 0;
        int profit=prices[0];
        int v=prices[0];
        for(vector<int>::size_type i=1;i<prices.size();++i)
        {
            if(prices[i]>v)
                profit+=prices[i]-v;
            v=prices[i];
        }
        return profit;
    }
};