LeetCode_122_买卖股票的最佳时机 II

自己写的

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