leetcode拓扑排序
文章平均质量分 85
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
457. Circular Array Loop[Medium](Leetcode每日一题-2021.08.07)--抄答案
Problem You are playing a game involving a circular array of non-zero integers nums. Each nums[i] denotes the number of indices forward/backward you must move if you are located at index i: If nums[i] is positive, move nums[i] steps forward, and If nums[i原创 2021-08-07 21:13:45 · 195 阅读 · 0 评论 -
802. Find Eventual Safe States[Medium](Leetcode每日一题-2021.08.05)
Problem We start at some node in a directed graph, and every turn, we walk along a directed edge of the graph. If we reach a terminal node (that is, it has no outgoing directed edges), we stop. We define a starting node to be safe if we must eventually wal原创 2021-08-05 18:55:28 · 109 阅读 · 0 评论 -
1203. Sort Items by Groups Respecting Dependencies(Leetcode每日一题-2021.01.12)--抄答案
Problem There are n items each belonging to zero or one of m groups where group[i] is the group that the i-th item belongs to and it’s equal to -1 if the i-th item belongs to no group. The items and the groups are zero indexed. A group can have no item bel原创 2021-01-12 21:05:47 · 205 阅读 · 0 评论 -
210. Course Schedule II(Leetcode每日一题-2020.05.17)
Problem There are a total of n courses you have to take, labeled from 0 to n-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 courses and a l原创 2020-05-17 21:57:03 · 207 阅读 · 0 评论