摘要:
栈 、 1.超时 class Solution { public: int largestRectangleArea(vector<int>& heights) { int n = heights.size(); int ans = 0; // 枚举左边界 for (int left = 0; le 阅读全文
摘要:
class Solution { public: string minWindow(string s, string t) { if (s == t) return s; // 如果这2个串一样最小覆盖就是s int len_s = s.size(); int len_t = t.size(); i 阅读全文
摘要:
class Solution { public: int findKthLargest(vector<int>& nums, int k) { priority_queue<int>dl; for(int i=0;i<nums.size();i++){ dl.push(nums[i]); } for 阅读全文