10 2019 档案

leetcode 188. Best Time to Buy and Sell Stock IV
摘要：class Solution { public: int maxProfit(int k, vector<int> &prices){ int n=prices.size(),v=0,p=0,ret=0; vector<int> profits; stack<pair<int,int>> vp; while(p<n){ for(v=p;v<n-1&&prices[v]>=prices[v+1];+ 阅读全文
posted @ 2019-10-02 11:24 141421356 阅读(93) 评论(0) 推荐(0)