提議就是又一次買入和賣出，每天價格都不一樣，就最大利潤，就一次dp，維護(hù)最小值就
class Solution {public: int maxPRofit(vector<int>& prices) { if(prices.size() == 0) return 0; int minn, sum; minn = prices[0]; sum = 0; for(int i = 1; i < prices.size(); ++ i){ if(prices[i] < minn){ minn = prices[i]; continue; } else{ if(prices[i] - minn > sum) sum = prices[i] - minn; } } return sum; }新聞熱點
疑難解答
