2020年9月5日
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1289169858763866112题解:https://blog.csdn.net/qq_38996065/article/details/79919366代码: #in 阅读全文
posted @ 2020-09-05 22:31 邢涌芝 阅读(122) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1286606445168746498题解:https://blog.csdn.net/qq_38996065/article/details/79919366代码: #in 阅读全文
posted @ 2020-09-05 22:30 邢涌芝 阅读(113) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1286606445168746497题解:https://blog.csdn.net/grooowing/article/details/45201267代码: #incl 阅读全文
posted @ 2020-09-05 22:28 邢涌芝 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1286606445168746496题解:https://blog.csdn.net/whd526/article/details/50718811代码: #include 阅读全文
posted @ 2020-09-05 22:27 邢涌芝 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1284061680920891393题解:https://blog.csdn.net/hh66__66hh/article/details/83822673代码: #inc 阅读全文
posted @ 2020-09-05 22:25 邢涌芝 阅读(136) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1284061680920891392题解:https://blog.csdn.net/tuzigg123/article/details/46897871代码: /*201 阅读全文
posted @ 2020-09-05 22:23 邢涌芝 阅读(162) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1284061680916697088 哈利·波特要考试了,他需要你的帮助。这门课学的是用魔咒将一种动物变成另一种动物的本事。例如将猫变成老鼠的魔咒是haha,将老鼠变成鱼的 阅读全文
posted @ 2020-09-05 22:21 邢涌芝 阅读(251) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1281571555116650497 “六度空间”理论又称作“六度分隔(Six Degrees of Separation)”理论。这个理论可以通俗地阐述为:“你和任何一个 阅读全文
posted @ 2020-09-05 22:16 邢涌芝 阅读(153) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1281571555116650496 This time let us consider the situation in the movie "Live and Let 阅读全文
posted @ 2020-09-05 22:14 邢涌芝 阅读(119) 评论(0) 推荐(0) 编辑
摘要: 题目:https://pintia.cn/problem-sets/1268384564738605056/problems/1281571555112456192 给定一个有N个顶点和E条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时,假设我们总是从编号 阅读全文
posted @ 2020-09-05 22:13 邢涌芝 阅读(148) 评论(0) 推荐(0) 编辑