ShenHang_的博客

我的思路： class Solution { private: vector<vector<int>>edges;//存储有向图 vector<int>inedge;//存储每个结点的入度 vector<int>res;//存储答案 public: vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) { ..

//BFS class Solution { public: vector<vector<int>> levelOrder(TreeNode* root) { if (root == NULL)return{}; queue<TreeNode*>myqueue; myqueue.push(root); vector<vector<int>>res; while (!myqueue.empty()) { int le.

很简单的题目。 class Solution { public: vector<int> largestValues(TreeNode* root) { if (root == NULL)return{}; vector<int>res; queue<TreeNode*>myqueue; myqueue.push(root); while...

class Solution { public: //对每个结点进行编号即可 int widthOfBinaryTree(TreeNode* root) { if (root == NULL)return 0; queue<pair<TreeNode*, unsigned long long>>myqueue; int res = 1; myqueu...

很简单，直接上代码： class Solution { public: vector<int> rightSideView(TreeNode* root) { if (root == NULL)return{}; vector<int>res; queue<TreeNode*>myqueue; myqueue.push(root); wh...

class Solution { public: int maxDistance(vector<vector<int>>& grid) { queue<pair<int, int>>myqueue; for (int i = 0; i < grid.size(); i++) { for (int j = 0; j...