毛球饲养员

class Solution { public: int removeDuplicates(vector<int>& nums) { if (nums.empty()) return 0; int pre = 0, cur = 0, n = nums.size(); while (cur<n)...

笨方法，算出了所有的递增序列，当时没有想到贪心 class Solution { public: int maxProfit(vector<int>& prices) { if(prices.size() == 0) return 0; int money = 0; int pos = 0, pr...