摘要: class Solution { public: int largestRectangleArea(vector<int>& h) { vector<int> l=vector<int>(h.size()); vector<int> r=l; stack<int> stk; int res=0; / 阅读全文
posted @ 2023-03-31 16:47 穿过雾的阴霾 阅读(15) 评论(0) 推荐(0)
摘要: class Solution { public: vector<vector<int>> res; void bfs(TreeNode* root) { queue<TreeNode*> q; q.push(root); int level=0; while(q.size ()) { int siz 阅读全文
posted @ 2023-03-31 09:21 穿过雾的阴霾 阅读(17) 评论(0) 推荐(0)
摘要: class Solution { public: vector<int> res; void bfs(TreeNode* root) { queue<TreeNode*> q; q.push(root); while(q.size ()) { auto p=q.front(); q.pop(); r 阅读全文
posted @ 2023-03-31 09:10 穿过雾的阴霾 阅读(10) 评论(0) 推荐(0)
摘要: class Solution { public: vector<vector<int>> res; void bfs(TreeNode* root) { queue<TreeNode*> q; q.push(root); while(q.size ()) { int size=q.size(); v 阅读全文
posted @ 2023-03-31 09:10 穿过雾的阴霾 阅读(14) 评论(0) 推荐(0)