一道水题,完全可以用数组解决,强行数据结构。
import java.util.*;
import java.io.*;
public class HDU2539 {
/*判断一个字符串是否以“ no good”结尾*/
public static boolean ifContainGood(String s){
if(s.endsWith(" no good"))
return false;
else
return true;
}
public static void main(String[] args) {
int n;
Scanner s = new Scanner(System.in);
while (s.hasNext()) {
n = s.nextInt();
s.nextLine();
if (n == 0)
break;
else {
List shang = new ArrayList(); //声明三个ArrayList
List xia = new ArrayList();
List sc = new ArrayList();
for (int i = 0; i < n; i++) {
String c = s.nextLine();
sc.add(c);
}
Iterator itr = sc.iterator();
for (int j = 0; j < n; j++) {
if (itr.hasNext()) {
String ja = itr.next();
if (j % 2 == 0) {
if (ifContainGood(ja))
shang.add("O");
else
shang.add("X");
} else {
if (ifContainGood(ja))
xia.add("O");
else
xia.add("X");
}
}
}
for (int k = 0; k < shang.size(); k++) {
System.out.print(k + 1 + " ");
}
System.out.println("Score");
Iterator i1 = shang.iterator();
Iterator i2 = xia.iterator();
int jishu1 = 0, jishu2 = 0;
while (i1.hasNext()) {
String t1 = i1.next();
System.out.print(t1 + " ");
if (t1.equals("O"))
jishu1++;
}
System.out.println(jishu1);
if (shang.size() == xia.size()) {
while (i2.hasNext()) {
String t2 = i2.next();
System.out.print(t2 + " ");
if (t2.equals("O"))
jishu2++;
}
System.out.println(jishu2);
} else {
while (i2.hasNext()) {
String t2 = i2.next();
System.out.print(t2 + " ");
if (t2.equals("O"))
jishu2++;
}
System.out.print("- ");
System.out.println(jishu2);
}
}
}
}
}