leetcode + 買賣股票，貪心

點擊打開連接 class Solution { public: int maxProfit(vector<int>& prices) { int sum = 0; for(int i=1; i<prices.size(); i++){ if(prices[i] > prices[i-1]){ sum +

>>阅读原文<<