LeetCode刷题——Array篇(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 sum = 0;
        bool flag = false;
        int begin = 0;
        int end = 1;
        prices.push_back(0);
        for (int i = 0; i < prices.size(); i++)
        {
            if (prices[i + 1] > prices[i]&&flag==false)
            {
                flag = true;
                begin = i;
            }
            else if (prices[i + 1]< prices[i]&&flag==true)
            {
                flag = false;
                end = i;
                sum += prices[end] - prices[begin];
            }
        }
        return sum;

    }
};
阅读更多
个人分类: Array
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭