码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode 207] Course Schedule

时间:2015-09-03 15:25:30      阅读:228      评论:0      收藏:0      [点我收藏+]

标签:leetcode   sort   

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:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.

topological sort, in a directed graph, every time found node without pre-node, then remove all its edges. until iterate all nodes or found cycle.


public boolean canFinish(int numCourses, int[][] prerequisites) {
        List<HashSet> preCourse = new ArrayList<HashSet>();
        for(int i=0;i<numCourses;i++){
            preCourse.add(new HashSet<Integer>());
        }
        for(int i=0;i<prerequisites.length;i++){
            preCourse.get(prerequisites[i][1]).add(prerequisites[i][0]);
        }
        int[] prenums = new int[numCourses];
        for(int i=0;i<numCourses;i++){
            Set set = preCourse.get(i);
            Iterator<Integer> iterator = set.iterator();
            while(iterator.hasNext()){
                prenums[iterator.next()]++;
            }
        }
        for(int i=0;i<numCourses;i++){
            int j=0;
            for(;j<numCourses;j++){
                if(prenums[j]==0) break;
            }
            if(j == numCourses) return false;
            prenums[j] = -1;
            Set set = preCourse.get(j);
            Iterator<Integer> iterator = set.iterator();
            while(iterator.hasNext()){
                prenums[iterator.next()]--;
            }
        }
        return true;
    }



版权声明:本文为博主原创文章,未经博主允许不得转载。

[LeetCode 207] Course Schedule

标签:leetcode   sort   

原文地址:http://blog.csdn.net/sbitswc/article/details/48194505

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!