摘要：
class Solution { public: int findKthLargest(vector<int>& nums, int k) { priority_queue<int, vector<int>, less<int>> maxheap; for(int i = 0; i < nums.s 阅读全文
posted @ 2021-07-22 23:46
三一一一317
阅读(51)
评论(0)
推荐(0)
摘要：
class Solution { public: int maximalSquare(vector<vector<char>>& matrix) { int m = matrix.size(); int n = matrix[0].size(); if(m==0) return 0; vector< 阅读全文
posted @ 2021-07-22 23:45
三一一一317
阅读(43)
评论(0)
推荐(0)
摘要：
class Solution { public: bool canFinish(int numCourses, vector<vector<int>>& prerequisites) { vector<vector<int>> edge; vector<int> index; edge.resize 阅读全文
posted @ 2021-07-22 20:11
三一一一317
阅读(51)
评论(0)
推荐(0)
摘要：
class Solution { public: int numIslands(vector<vector<char>>& grid) { int row = grid.size(); int col = grid[0].size(); if(row==0) return 0; int count 阅读全文
posted @ 2021-07-22 16:42
三一一一317
阅读(46)
评论(0)
推荐(0)
摘要：
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : 阅读全文
posted @ 2021-07-22 16:11
三一一一317
阅读(37)
评论(0)
推荐(0)
浙公网安备 33010602011771号