public class Solution {
public int[] FindOrder(int numCourses, int[][] prerequisites){
int[] _in = new int[numCourses]
for (int i = 0; i < prerequisites.GetLength(0); i++){
_in[prerequisites[i][0]]++;
}
IList<int> res = new List<int>();
while (_in.Contains(0)){
for (int i = 0; i < numCourses; i++){
if (_in[i] == 0){
_in[i]--;
for (int j = 0; j < prerequisites.GetLength(0); j++){
if (prerequisites[j][1] == i)
_in[prerequisites[j][0]]--;
}
}
}
}
if (_in.Sum() == -1 * numCourses)
return false;
else{
res.Clear();
return true;
}
}
}
课程表
最新推荐文章于 2024-08-06 04:27:00 发布