C++ LC初级算法002 买卖股票的最佳时机 II

Moyan_Li

于 2022-08-28 10:04:48 发布

阅读量435

点赞数

文章标签：算法 c++ leetcode

本文链接：https://blog.csdn.net/Moyan_Li/article/details/126566678

版权

股票问题可简化为：求一数字序列相连项的非负差值之和

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

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