LeetCode-207/210. Course Schedule (JAVA) (课程安排)

207. Course Schedule

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 list of prerequisite pairs, is it possible for you to finish all courses?

For example:

2, [[1,0]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.

2, [[1,0],[0,1]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.

Note:

1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

此问题等价于 图(or forest)中有无环的存在.（拓扑排序解决）

// BFS拓扑排序
	public boolean canFinish(int numCourses, int[][] prerequisites) {
		// 初始化图
		Map<Integer, List<Integer>> map = new HashMap<>();
		// 存储每个结点的入度
		int[] indegree = new int[numCourses];
		for (int i = 0; i < prerequisites.length; i++) {
			int first = prerequisites[i][0];
			int second = prerequisites[i][1];
			if (!map.containsKey(first))
				map.put(first, new ArrayList<>());
			map.get(first).add(second);
			// 入度加一，从first->second
			indegree[second]++;
		}
		// 存储所有入度为0的结点
		Queue<Integer> q = new LinkedList<>();
		for (int i = 0; i < numCourses; i++) {
			if (indegree[i] == 0)
				q.offer(i);
		}
		// 用来计算拓扑排序的结点个数
		int count = 0;
		while (!q.isEmpty()) {
			// 获取第一格入度为0的结点
			int val = q.poll();
			count++;
			// 判断很关键
			if (!map.containsKey(val))
				continue;
			// 获取val的临结点
			List<Integer> tmp = map.get(val);
			for (int i = 0; i < tmp.size(); i++) {
				// 把所有的以val为开头的入度减一
				int idx = tmp.get(i);
				indegree[idx]--;
				// 如果入度为0，则把该结点加入队列中
				if (indegree[idx] == 0)
					q.offer(idx);
			}
		}
		return count == numCourses;
	}

210. Course Schedule II

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 list of prerequisite pairs, return the ordering of courses you should take to finish all courses.

There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.

For example:

2, [[1,0]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0. So the correct course order is [0,1]

4, [[1,0],[2,0],[3,1],[3,2]]

There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is [0,1,2,3]. Another correct ordering is[0,2,1,3].

Note:

1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

public int[] findOrder(int numCourses, int[][] prerequisites) {
		// 初始化图
		Map<Integer, List<Integer>> map = new HashMap<>();
		// 存储每个结点的入度
		int[] indegree = new int[numCourses];
		///
		// 加入结果集合，从后往前依次加入入度为0的点
		int[] res = new int[numCourses];
		for (int i = 0; i < prerequisites.length; i++) {
			int first = prerequisites[i][0];
			int second = prerequisites[i][1];
			if (!map.containsKey(first))
				map.put(first, new ArrayList<>());
			map.get(first).add(second);
			// 入度加一，从first->second
			indegree[second]++;
		}
		int index = numCourses - 1;
		// 存储所有入度为0的结点
		Queue<Integer> q = new LinkedList<>();
		for (int i = 0; i < numCourses; i++) {
			if (indegree[i] == 0) {
				q.offer(i);
				/
				res[index--] = i;
			}
		}
		// 用来计算拓扑排序的结点个数
		while (!q.isEmpty()) {
			// 获取第一格入度为0的结点
			int val = q.poll();
			// 判断很关键
			if (!map.containsKey(val))
				continue;
			// 获取val的临结点
			List<Integer> tmp = map.get(val);
			for (int i = 0; i < tmp.size(); i++) {
				// 把所有的以val为开头的入度减一
				int idx = tmp.get(i);
				indegree[idx]--;
				// 如果入度为0，则把该结点加入队列中
				if (indegree[idx] == 0) {
					q.offer(idx);
					/
					res[index--] = idx;
				}
			}
		}
		if (index != -1)
			return new int[0];
		else
			return res;
	}