DFS
文章平均质量分 84
新西兰做的饭
Here we go!
展开
-
PTA-最短路径(1003/1018/1030/1072/1087)
1003 Emergency (25 分)As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pai原创 2022-03-04 19:24:35 · 923 阅读 · 0 评论 -
通过四道编程题总结图的搜索(DFS/BFS)——PTA(1013/1021/1034/1076)
1013 Battle Over Cities (25 分)It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other hig原创 2022-02-28 01:19:45 · 603 阅读 · 0 评论 -
PTA-平衡二叉树(1066)
1066 Root of AVL Tree (25 分)An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this prope原创 2022-02-07 12:00:35 · 470 阅读 · 0 评论 -
PTA-二叉查找树(1043/1064/1099)
1043 Is It a Binary Search Tree (25 分)A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree of a node co.原创 2022-02-06 18:42:14 · 878 阅读 · 0 评论 -
PTA-树的遍历(1079/1090/1094/1106/1004/1053)
1079 Total Sales of Supply Chain (25 分)A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Starting from one root supplier, everyone on the chain buys pro.原创 2022-01-22 15:45:35 · 965 阅读 · 0 评论 -
PTA-二叉树的遍历(1020/1086/1102)
1020 Tree Traversals (25 分)Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.Inpu原创 2022-01-19 15:56:01 · 1440 阅读 · 0 评论 -
PTA-DFS(1103)
1103 Integer Factorization (30 分)The K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K−P factorization of N for any positive integers N, K and P.原创 2022-01-15 18:09:40 · 360 阅读 · 0 评论 -
LeetCode130:被围绕的区域(DFS+BFS+并查集)
被围绕的区域原创 2021-05-12 19:50:48 · 129 阅读 · 1 评论 -
图文详解图的表示及DFS和BFS
#define MAXVEX 100#define INFINITY 65535//邻接矩阵typedef struct { char vexs[MAXVEX]; int arc[MAXVEX][MAXVEX]; int numVerTexes,numEdges;}MGraph;//建立无向网图的邻接矩阵void CreateMGraph(MGraph *G){ int x,y,w; cout<<"输入顶点数和边数:"<<endl; cin>>原创 2021-05-10 10:40:12 · 2790 阅读 · 0 评论 -
LeetCode200 :岛屿数量(DFS+BFS+并查集)
LeetCode200.岛屿数量这是一道求连通块分支个数的题,是一道dfs模板题。DFSclass Solution {public: int m,n;//m行n列 bool board(int x,int y) { if((x>=0)&&(y>=0)&&(x<n)&&(y<m)) { return true; }原创 2021-04-28 15:09:12 · 272 阅读 · 0 评论