拓扑排序
文章平均质量分 86
memcpy0
希望探索文理结合的自由之路。
展开
-
LeetCode 1857. Largest Color Value in a Directed Graph【拓扑排序,动态规划】困难
本文属于「征服LeetCode」系列文章之一,这一系列正式开始于2021/08/12。由于LeetCode上部分题目有锁,本系列将至少持续到刷完所有无锁题之日为止;由于LeetCode还在不断地创建新题,本系列的终止日期可能是永远。在这一系列刷题文章中,我不仅会讲解多种解题思路及其优化,还会用多种编程语言实现题解,涉及到通用解法时更将归纳总结出相应的算法模板。。原创 2023-07-29 16:42:33 · 388 阅读 · 1 评论 -
LeetCode 2050. Parallel Courses III【记忆化搜索,动态规划,拓扑排序】困难
本文属于「征服LeetCode」系列文章之一,这一系列正式开始于2021/08/12。由于LeetCode上部分题目有锁,本系列将至少持续到刷完所有无锁题之日为止;由于LeetCode还在不断地创建新题,本系列的终止日期可能是永远。在这一系列刷题文章中,我不仅会讲解多种解题思路及其优化,还会用多种编程语言实现题解,涉及到通用解法时更将归纳总结出相应的算法模板。。原创 2023-07-29 11:32:44 · 273 阅读 · 0 评论 -
HDU 3342 Legal or Not【Graph/Topological Sort】
Problem Description ACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many “holy cows” like HH, hh, AC, ZT, lcc, BF, Qinz and so on chat on-line to exchange their ideas. When so原创 2021-03-15 00:30:33 · 174 阅读 · 0 评论 -
HDU 1285 确定比赛名次【Graph/Topological Sort】
Problem Description 有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排名。 Input 输入有若干组,每组中的第一行为二个数N(1<=N<=500),M;其中N表示队伍的个数,M表示接着有M行的输入数据。接下来的M行数据中,每行也有两个整数原创 2021-03-15 00:18:39 · 174 阅读 · 0 评论 -
LeetCode 210. Course Schedule II【图,DFS,BFS,拓扑排序】中等
There are a total of n courses you have to take labelled from 0 to n - 1. Some courses may have prerequisites, for example, if prerequisites[i] = [ai, bi] this means you must take the course bi before the course ai. Given the total number of cour原创 2020-12-01 10:30:12 · 385 阅读 · 0 评论 -
LeetCode 207. Course Schedule【图,DFS,拓扑排序,判环】中等
There are a total of numCourses courses you have to take, labeled from 0 to numCourses-1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1] Given the total number of cours原创 2020-12-01 00:01:18 · 545 阅读 · 1 评论 -
LeetCode C++ 310. Minimum Height Trees【Graph/BFS/拓扑排序】中等
Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2] Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [9,4] Note: Each element in the result must be unique. The re原创 2020-11-04 21:31:32 · 315 阅读 · 0 评论 -
LeetCode C++ 1591. Strange Printer II【模拟/拓扑排序】困难
There is a strange printer with the following two special requirements: On each turn, the printer will print a solid rectangular pattern of a single color on the grid. This will cover up the existing colors in the rectangle. Once the printer has used a.原创 2020-09-25 14:59:36 · 331 阅读 · 0 评论 -
LeetCode C++ 684. Redundant Connection【Tree/Graph/Union Find/TopologicalSort】中等
In this problem, a tree is an undirected graph that is connected and has no cycles. The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, ..., N ), with one additional edge added. The added edge has two different vertic原创 2020-09-17 23:45:05 · 220 阅读 · 0 评论