BFS
ShenHang_
一个编程小菜鸡
展开
-
课程表Ⅱ(使用BFS完成拓扑排序)
我的思路:class Solution {private: vector<vector<int>>edges;//存储有向图 vector<int>inedge;//存储每个结点的入度 vector<int>res;//存储答案public: vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) { ..原创 2020-05-17 15:49:18 · 183 阅读 · 0 评论 -
二叉树的层序(以及锯齿状)遍历(BFS)
//BFSclass 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.原创 2020-05-13 12:46:38 · 183 阅读 · 0 评论 -
在每个树行中找最大值(BFS)
很简单的题目。class Solution {public: vector<int> largestValues(TreeNode* root) { if (root == NULL)return{}; vector<int>res; queue<TreeNode*>myqueue; myqueue.push(root); while...原创 2020-04-22 16:19:04 · 211 阅读 · 0 评论 -
二叉树的最大宽度(BFS)
class Solution {public: //对每个结点进行编号即可 int widthOfBinaryTree(TreeNode* root) { if (root == NULL)return 0; queue<pair<TreeNode*, unsigned long long>>myqueue; int res = 1; myqueu...原创 2020-04-22 15:28:29 · 338 阅读 · 0 评论 -
二叉树的右视图(BFS)
很简单,直接上代码:class Solution {public: vector<int> rightSideView(TreeNode* root) { if (root == NULL)return{}; vector<int>res; queue<TreeNode*>myqueue; myqueue.push(root); wh...原创 2020-04-22 10:43:06 · 130 阅读 · 0 评论 -
200331题(1162.地图分析(BFS))
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...原创 2020-03-29 12:07:56 · 196 阅读 · 0 评论