122. Best Time to Buy and Sell Stock II 买股票贪心算法

1 int maxProfit(vector<int> &prices) {
2     int ret = 0;
3     for (size_t p = 1; p < prices.size(); ++p) 
4       ret += max(prices[p] - prices[p - 1], 0);    
5     return ret;
6 }

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