best-time-to-buy-and-sell-stock i &ii

最新推荐文章于 2019-06-24 20:43:17 发布

njudongchen

最新推荐文章于 2019-06-24 20:43:17 发布

阅读量319

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/njudongchen/article/details/70229213

本文介绍两种算法解决股票买卖问题：动态规划法用于只能进行一次买卖的情况，贪心算法适用于可以进行多次买卖的情形。通过具体代码实现展示了如何计算最大利润。

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

Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

动态规划

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

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

    }
};