[PAT] 1077 Kuchiguse （20 分）Java

The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker's personality. Such a preference is called "Kuchiguse" and is often exaggerated artistically in Anime and Manga. For example, the artificial sentence ending particle "nyan~" is often used as a stereotype for characters with a cat-like personality:

• Itai nyan~ (It hurts, nyan~)

• Ninjin wa iyada nyan~ (I hate carrots, nyan~)

Now given a few lines spoken by the same character, can you find her Kuchiguse?

Input Specification:

Each input file contains one test case. For each case, the first line is an integer N (2≤N≤100). Following are N file lines of 0~256 (inclusive) characters in length, each representing a character's spoken line. The spoken lines are case sensitive.

Output Specification:

For each test case, print in one line the kuchiguse of the character, i.e., the longest common suffix of all N lines. If there is no such suffix, write nai.

Sample Input 1:

3
Itai nyan~
Ninjin wa iyadanyan~
uhhh nyan~

Sample Output 1:

nyan~

Sample Input 2:

3
Itai!
Ninjinnwaiyada T_T
T_T

Sample Output 2:

nai

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * @Auther: Xingzheng Wang
 * @Date: 2019/2/26 17:59
 * @Description: pattest
 * @Version: 1.0
 */
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String s1 = reader.readLine();
        String s2 = reader.readLine();
        StringBuffer sb = new StringBuffer(s2);
        sb.reverse();
        for (int i = 1; i < Integer.parseInt(s1); i++) {
            char[] c = sb.toString().toCharArray();
            String s = reader.readLine();
            StringBuffer sb1 = new StringBuffer(s);
            sb1.reverse();
            char[] c1 = sb1.toString().toCharArray();
            for (int j = 0; j < c.length; j++) {
                if (c[j] != c1[j]) {
                    sb.delete(j, sb.length());
                    break;
                }
            }
        }
        sb.reverse();
        if (sb.length() > 0) {
            System.out.print(sb);
        }else {
            System.out.print("nai");
        }
    }
}