已经彻底无语了,先是发现自己之前写的冒泡排序错了,又学习了插入排序,发现两个好像差不多,排序方法那么多种。。。是该好好屡屡思路了。。。
之后,自己用的插入排序提交,发现时间要1410MS,就寻思优化下吧!想到之前第1005题(居然也是快速排序类的题!看来快排是非学不可了!以后要排序就先用快排!)看其他人用的Comparator接口时间优化了,就把自己的也改成了这种形式的了。。。没想到居然变成了2000MS!!!!已经无语了,为啥呀,想不明白。哎。。。所以就看了下别人是怎么做的。用的List和Collections的sort。谁能告诉我区别在哪里。。。。看来要补得功课还不少!
不过还是把代码贴出来吧,是最初的插入排序的版本
代码:
package Test1;
import java.util.Scanner;
public class Test8_1014 {
/**
* by qr jobdu 1014 2014-8-8
*/
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt(); // number of students
while (n != 0) {
int m = scan.nextInt();
int g = scan.nextInt();
int weight[] = new int[m + 1]; // weight of each problem 1->m
for (int i = 1; i < m + 1; i++)
weight[i] = scan.nextInt();
String stunum[] = new String[n]; // student number
int grade[] = new int[n]; // student grade
int number = 0;// student passed number
for (int i = 0; i < n; i++) {
stunum[i] = scan.next();
grade[i] = 0;
int pronum = scan.nextInt();// problem solved
for (int j = 0; j < pronum; j++) {
int pro = scan.nextInt();
grade[i] += weight[pro];
}
if (grade[i] >= g)
number++;
}
System.out.println(number);
// output result
if (number != 0) { // insert sort
for (int i = 1; i < n; i++) {
for (int j = i; j > 0; j--) {
if (grade[j - 1] < grade[j]
|| (grade[j - 1] == grade[j] && stunum[j - 1]
.compareTo(stunum[j]) > 0)) {
int temp1 = grade[j - 1];
grade[j - 1] = grade[j];
grade[j] = temp1;
String temp2 = stunum[j - 1];
stunum[j - 1] = stunum[j];
stunum[j] = temp2;
}
}
}
for (int i = 0; i < number; i++) {
System.out.println(stunum[i] + " " + grade[i]);
}
}
n = scan.nextInt();
}
}
}
之后做题肯定还会遇到快排和集合类,必须要自己写一次才行啊!恩!