摘要: class Solution { public: int maxDiff(vector<int>& nums) { if(nums.size()==0) return 0; int buy=nums[0],res=0; for (int i = 1; i < nums.size(); i ++ ) 阅读全文
posted @ 2023-05-13 14:08 穿过雾的阴霾 阅读(16) 评论(0) 推荐(0)
摘要: class Solution { public: vector<int> res; deque<int> q; vector<int> maxInWindows(vector<int>& nums, int k) { for (int i = 0; i < nums.size(); i ++ ) { 阅读全文
posted @ 2023-05-13 14:07 穿过雾的阴霾 阅读(11) 评论(0) 推荐(0)