LeetCode – Refresh – Best Time to Buy and Sell Stock ii

This is simple, use greedy algorithm will solve the problem.

 

 1 class Solution {
 2 public:
 3     int maxProfit(vector<int> &prices) {
 4         int len = prices.size(), result = 0;
 5         if (len < 2) return 0;
 6         for (int i = 0; i < len-1; i++) {
 7             if (prices[i+1] - prices[i] > 0) {
 8                 result += prices[i+1] - prices[i];
 9             }
10         }
11         return result;
12     }
13 };

 

转载于:https://www.cnblogs.com/shuashuashua/p/4346163.html