典型的贪心问题。
class Solution {
public:
int maxProfit(vector<int>& prices) {
if(prices.size() <=1 ) return 0;
int max = 0;
for(size_t i = 0; i <= prices.size()-2; i++)
max = prices[i+1] - prices[i] > 0? max + prices[i+1] - prices[i] : max;
return max;
}
};