solution_122

最新推荐文章于 2022-08-29 16:48:27 发布

哲学加农炮

最新推荐文章于 2022-08-29 16:48:27 发布

阅读量104

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_40132934/article/details/79123032

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

LeetCode Problem Description

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

Solution

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int ret = 0;
        for (size_t p = 1; p < prices.size(); ++p) 
          ret += max(prices[p] - prices[p - 1], 0);    
        return ret;
    }
};