摘要：
class Solution { public: int numIslands(vector>& grid) { if (grid.empty() || grid[0].empty()) return 0; int count=0; int m = grid.size(), n = grid[0].size(); ... 阅读全文
摘要：
//关键就是把每一层的节点数记下来，当循环完当层节点数再输出队列的最后一位耗时4ms class Solution { public: vector rightSideView(TreeNode* root) { vector res; if(!root)return res; queue q; q... 阅读全文