Class Name: Prerequisites
Mathod Name: orderClasses
Parameters: String[]
Returns: String[]
You are a student at a college with the most unbelievably complex prerequisite
structure ever. To help you schedule your classes, you decided to put together
a program that returns the order in which the classes should be taken.
Implement a class Prerequisites which contains a method orderClasses. The
method takes a String[] that contains the classes you must take and returns a
String[] of classes in the order the classes should be taken so that all
prerequisites are met.
String[] elements will be of the form (and TopCoder will ensure this):
"CLASS: PRE1 PRE2 ..." where PRE1 and PRE2 are prerequisites of CLASS. CLASS,
PRE1, PRE2, ... consist of a department name (3 or 4 capital letters, A-Z
inclusive) followed by a class number (an integer between 100 and 999,
inclusive). The department name should be immediately followed by the class
number with no additional characters, numbers or spaces (i.e. MATH217). It is
not necessary for a class to have prerequisites. In such a case, the colon is
the last character in the String.
You can only take one class at a time, therefore, use the following rules to
determine which class to take :
1) Any prerequisite class(es) listed for a class must be taken before the class
can be taken.
2) If multiple classes can be taken at the same time, you take the one with the
lowest number first, regardless of department.
3) If multiple classes with the same number can be taken at the same time, you
take the department name which comes first in alphabetical order.
4) If the inputted course schedule has errors, return a String[] of length 0.
There is an error if it is impossible to return the classes in an order such
that all prerequisites are met, or if a prerequisite is a course that does not
have its own entry in the inputted String[].
Examples of valid input Strings are:
"CSE111: CSE110 MATH101"
"CSE110:"
Examples of invalid input Strings are:
"CS117:" (department name must consist of 3 - 4 capital letters, inclusive)
"cs117:" (department name must consist of 3 - 4 capital letters, inclusive)
"CS9E11:" (department name must be letters only)
"CSE110: " (no trailing spaces allowed)
"CSE110: CSE101 " (no trailing spaces allowed)
"MATH211: MAM2222" (class number to large)
"MATH211: MAM22" (class number to small)
"ENGIN517: MATH211" (department name to large)
Here is the method signature (be sure your method is public):
String[] orderClasses(String[] classSchedule);
TopCoder will make sure classSchedule contains between 1 and 20 Strings,
inclusive, all of the form above. The Strings will have between 1 and 50
characters, inclusive. TopCoder will check that the syntax of the Strings are
correct: The Strings will contain a valid class name, followed by a colon,
possibly followed by a series of unique prerequisite classes separated by
single spaces. Also, TopCoder will ensure that each class has at most one
entry in the String[].
Examples:
If classSchedule={
"CSE121: CSE110",
"CSE110:",
"MATH122:",
}
The method should return: {"CSE110","CSE121","MATH122"}
If classSchedule={
"ENGL111: ENGL110",
"ENGL110: ENGL111"
}
The method should return: {}
If classSchedule=[
"ENGL111: ENGL110"
}
The method should return: {}
If classSchedule={
"CSE258: CSE244 CSE243 INTR100"
"CSE221: CSE254 INTR100"
"CSE254: CSE111 MATH210 INTR100"
"CSE244: CSE243 MATH210 INTR100"
"MATH210: INTR100"
"CSE101: INTR100"
"CSE111: INTR100"
"ECE201: CSE111 INTR100"
"ECE111: INTR100"
"CSE243: CSE254"
"INTR100:"
}
The method should return:
{"INTR100","CSE101","CSE111","ECE111","ECE201","MATH210","CSE254","CSE221","CSE2
43","CSE244","CSE258"}
Definition
Class: Prerequisites
Method: orderClasses
Parameters: String[]
Returns: String[]
Method signature: String[] orderClasses(String[] param0)
(be sure your method is public)
------------------------------------------------------------我的解法如下----------------------------------------
想法很简单，这道题本质上是一道排序问题，我们只需要定义好排序的逻辑，然后应用快排就可以了。
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class Prerequisites {
private static final String[] EMPTY = {};
Map < String,Klass > classes = new HashMap < String,Klass > ();
static class Klass implements Comparable < Klass > {
String name;
int number;
String dept;
List < Klass > pres = new ArrayList < Klass > ();
boolean exist = false ;
Klass(String name){
this .name = name;
int len = name.length();
this .number = Integer.parseInt(name.substring(len - 3 ));
this .dept = name.substring( 0 ,len - 3 );
}
private boolean isPre(Klass k){
if (k == this ) return false ;
for (Klass p: this .pres){
if (k == p || p.isPre(k)) return true ;
}
return false ;
}
@Override
public int compareTo(Klass that) {
boolean pre = this .isPre(that);
boolean sub = that.isPre( this );
if (pre && sub){
throw new RuntimeException( " circle detected " );
}
else if (pre){
return 1 ;
}
else if (sub){
return - 1 ;
}
if ( this .number != that.number) return this .number - that.number;
return this .dept.compareTo(that.dept);
}
}
private Klass getClass(String name){
Klass k = classes.get(name);
if (k == null ){
k = new Klass(name);
classes.put(name, k);
}
return k;
}
public String[] orderClasses(String[] classSchedule){
classes.clear();
//parse the input
for (String s:classSchedule){
int idx = s.indexOf( " : " );
String name = s.substring( 0 ,idx);
Klass k = getClass(name);
k.exist = true ;
if (idx != s.length() - 1 ){
String[] pres = s.substring(idx + 1 ).split( " " );
for (String pre:pres){
if (pre.length() > 0 ){
Klass p = getClass(pre);
k.pres.add(p);
}
}
}
}
Klass [] sortedClasses = (Klass[]) classes.values().toArray( new Klass[ 0 ]);
for (Klass k:sortedClasses){
if ( ! k.exist){
return EMPTY;
}
}
try {
Arrays.sort(sortedClasses);
} catch (Exception e) {
return EMPTY;
}
String[] result = new String[sortedClasses.length];
int c = 0 ;
for (Klass k:sortedClasses){
result[c ++ ] = k.name;
}
return result;
}
}