題目要求

P1042題目鏈接

分析

本題的EOF顯然是’E’，其后就算有任何內(nèi)容也都與我們需要的數(shù)據(jù)無關(guān)啦，這是一定要記住的。

不能直接將scanner.nextLine()的數(shù)據(jù)用于算法，因為要處理兩次（除非將兩個一起進行，但沒必要啊）。
存在LinkedList中即可。

單獨設(shè)置一個函數(shù)進行勝負判斷，因為不需要進行判斷誰輸誰贏，贏就完事，所以可以這么寫：

private static boolean judgeEnding(int tempPointW, int tempPointL, int endCondition) {if ((tempPointW-tempPointL >= 2 && tempPointW >= endCondition) ||(tempPointL-tempPointW >= 2 && tempPointL >= endCondition)) {return true;}return false;}

我的策略是當(dāng)讀的一行String里有“E”的時候（用contains()方法），取一下indexOf()，進而取一下substring()，防止EOF以后的數(shù)據(jù)影響結(jié)果，并將循環(huán)結(jié)束。

注意下面的結(jié)構(gòu)會“死循環(huán)”：

while(scanner,hasNextLine()) {String s = scanner.nextLine(); }

這個該死的結(jié)構(gòu)一般只能避免使用，所以EOF自然是極好的啦~

每次獲勝的時候，將數(shù)據(jù)存儲一下并將臨時數(shù)據(jù)清空一下就好啦。

很坑的是如果取“”這樣的話，可能出現(xiàn)0:0，本題0:0也要記錄……我不知道但因此WA了……

第一次提交——WA

import java.util.LinkedList; import java.util.List; import java.util.Scanner;public class Main {private static boolean judgeEnding(int tempPointW, int tempPointL, int endCondition) {if ((tempPointW-tempPointL >= 2 && tempPointW >= endCondition) ||(tempPointL-tempPointW >= 2 && tempPointL >= endCondition)) {return true;}return false;}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);List<String> infoList = new LinkedList<>(), resultList = new LinkedList<>();boolean flag = false;while (!flag) {String line = scanner.nextLine();int index = line.indexOf("E");if (index != -1) {line = line.substring(0, index);flag = true;}infoList.add(line);}int tempPointW = 0, tempPointL = 0;scanner.close();for (String s : infoList) {for (char c : s.toCharArray()) {if (c == 'W') {tempPointW++;} else { //'L'tempPointL++;}//結(jié)束判斷if (judgeEnding(tempPointW, tempPointL, 11)) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}}}if (tempPointW != 0 || tempPointL != 0) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}resultList.add("");for (String s : infoList) {for (char c : s.toCharArray()) {if (c == 'W') {tempPointW++;} else { //'L'tempPointL++;}//結(jié)束判斷if (judgeEnding(tempPointW, tempPointL, 21)) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}}}if (tempPointW != 0 || tempPointL != 0) {resultList.add(tempPointW + ":" + tempPointL);}for (String s : resultList) {System.out.println(s);}}}

獲取了測試數(shù)據(jù)1：
in
EWLWLWL
out
0:0

0:0

錯因是空串沒處理，我決定加一個特判。

第二次提交——WA

import java.util.LinkedList; import java.util.List; import java.util.Scanner;public class Main {private static boolean judgeEnding(int tempPointW, int tempPointL, int endCondition) {if ((tempPointW-tempPointL >= 2 && tempPointW >= endCondition) ||(tempPointL-tempPointW >= 2 && tempPointL >= endCondition)) {return true;}return false;}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);List<String> infoList = new LinkedList<>(), resultList = new LinkedList<>();boolean flag = false;while (!flag) {String line = scanner.nextLine();int index = line.indexOf("E");if (index != -1) {line = line.substring(0, index);flag = true;}infoList.add(line);}if (infoList.size() == 1 && "".equals(infoList.get(0))) {System.out.println("0:0\n\n0:0");}int tempPointW = 0, tempPointL = 0;scanner.close();for (String s : infoList) {for (char c : s.toCharArray()) {if (c == 'W') {tempPointW++;} else { //'L'tempPointL++;}//結(jié)束判斷if (judgeEnding(tempPointW, tempPointL, 11)) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}}}if (tempPointW != 0 || tempPointL != 0) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}resultList.add("");for (String s : infoList) {for (char c : s.toCharArray()) {if (c == 'W') {tempPointW++;} else { //'L'tempPointL++;}//結(jié)束判斷if (judgeEnding(tempPointW, tempPointL, 21)) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}}}if (tempPointW != 0 || tempPointL != 0) {resultList.add(tempPointW + ":" + tempPointL);}for (String s : resultList) {System.out.println(s);}}}

獲取了測試數(shù)據(jù)10：
in
WWWWWWWWWWWEadfadf;jadf
out
11:0
0:0

11:0

這樣的話我覺得特判不是問題根源，而是應(yīng)該在每次結(jié)束以后不加特判，就有了最后的代碼。

第三次提交——AC

import java.util.LinkedList; import java.util.List; import java.util.Scanner;public class Main {private static boolean judgeEnding(int tempPointW, int tempPointL, int endCondition) {if ((tempPointW-tempPointL >= 2 && tempPointW >= endCondition) ||(tempPointL-tempPointW >= 2 && tempPointL >= endCondition)) {return true;}return false;}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);List<String> infoList = new LinkedList<>(), resultList = new LinkedList<>();boolean flag = false;while (!flag) {String line = scanner.nextLine();int index = line.indexOf("E");if (index != -1) {line = line.substring(0, index);flag = true;}infoList.add(line);}int tempPointW = 0, tempPointL = 0;scanner.close();for (String s : infoList) {for (char c : s.toCharArray()) {if (c == 'W') {tempPointW++;} else { //'L'tempPointL++;}//結(jié)束判斷if (judgeEnding(tempPointW, tempPointL, 11)) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}}}resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;resultList.add("");for (String s : infoList) {for (char c : s.toCharArray()) {if (c == 'W') {tempPointW++;} else { //'L'tempPointL++;}//結(jié)束判斷if (judgeEnding(tempPointW, tempPointL, 21)) {resultList.add(tempPointW + ":" + tempPointL);tempPointW = 0;tempPointL = 0;}}}resultList.add(tempPointW + ":" + tempPointL);for (String s : resultList) {System.out.println(s);}}}

總結(jié)

以上是生活随笔為你收集整理的根据特殊EOF的序列判断比赛输赢（洛谷P1042题题解，Java语言描述）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。