数据结构
BuzzLightY
算法工程师、LeetCode、机器学习、算法竞赛
展开
-
【PTA】 1139 First Contact
1139First Contact(30分)Unlikenowadays, the waythat boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would usually not contact her directly in the first place. Instead, he m...原创 2020-08-07 00:09:11 · 795 阅读 · 0 评论 -
【C/C++】List Leaves/层序遍历叶子结点
7-4 List Leaves(25 分)Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification:Each input file contains one test case. For eac原创 2017-09-23 14:39:22 · 719 阅读 · 0 评论 -
【C/C++】树的同构
7-3 树的同构(25 分)给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2,则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的,因为我们把其中一棵树的结点A、B、G的左右孩子互换后,就得到另外一棵树。而图2就不是同构的。图1图2现给定两棵树,请你判断它们是否是同构的。输入格式:输入给出2棵二叉树树的信息原创 2017-09-23 14:47:55 · 2155 阅读 · 0 评论 -
【C/C++】06-图2 Saving James Bond - Easy Version(25分)
06-图2 Saving James Bond - Easy Version(25 分)This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the world's most famous spy, was captured by a group of原创 2017-10-12 20:50:00 · 965 阅读 · 0 评论 -
【C/C++】列出连通集
给定一个有N个顶点和E条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。输入格式:输入第1行给出2个整数N(0N≤10)和E,分别是图的顶点数和边数。随后E行,每行给出一条边的两个端点。每行中的数字之间用1空格分隔。输出格式:按照"{ v1 v2原创 2017-10-12 21:04:10 · 557 阅读 · 0 评论 -
【C/C++】1072. Gas Station (30)
1072. Gas Station (30)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA gas station has to be built at such a locati原创 2017-10-22 14:47:18 · 382 阅读 · 0 评论 -
【C/C++】1076. Forwards on Weibo (30)
1076. Forwards on Weibo (30)Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed原创 2017-10-13 19:16:16 · 360 阅读 · 0 评论