摘要: 1 //数组是连续的 2 class Solution 3 { 4 public: 5 int maxSubarraySumCircular(vector<int>& A) 6 { 7 // 单调队列 8 int n = A.size(); 9 deque<int> q; 10 for(int i 阅读全文
posted @ 2020-04-08 22:50 Jinxiaobo0509 阅读(174) 评论(0) 推荐(0)
摘要: 1 class Solution 2 { 3 public: 4 vector<int> maxSlidingWindow(vector<int>& nums, int k) 5 { 6 vector<int> res; 7 deque<int> q; 8 for(int i = 0;i < num 阅读全文
posted @ 2020-04-08 16:29 Jinxiaobo0509 阅读(126) 评论(0) 推荐(0)
摘要: 1 //自底向上层层叠加 2 class Solution 3 { 4 public: 5 int trap(vector<int>& height) 6 { 7 int res = 0; 8 stack<int> stk; 9 10 for(int i = 0;i < height.size(); 阅读全文
posted @ 2020-04-08 16:04 Jinxiaobo0509 阅读(111) 评论(0) 推荐(0)
摘要: 1 class Solution 2 { 3 public: 4 int largestRectangleArea(vector<int>& heights) 5 { 6 int n = heights.size(); 7 vector<int> left(n),right(n); 8 9 //用单 阅读全文
posted @ 2020-04-08 15:27 Jinxiaobo0509 阅读(115) 评论(0) 推荐(0)