Skip to content

1043 输出 PATest

给定一个长度不超过 104 的、仅由英文字母构成的字符串。请将字符重新调整顺序,按 PATestPATest.... 这样的顺序输出,并忽略其它字符。当然,六种字符的个数不一定是一样多的,若某种字符已经输出完,则余下的字符仍按 PATest 的顺序打印,直到所有字符都被输出。

输入格式:

输入在一行中给出一个长度不超过 104 的、仅由英文字母构成的非空字符串。

输出格式:

在一行中按题目要求输出排序后的字符串。题目保证输出非空。

输入样例:

tex
redlesPayBestPATTopTeePHPereatitAPPT
redlesPayBestPATTopTeePHPereatitAPPT

输出样例:

tex
PATestPATestPTetPTePePee
PATestPATestPTetPTePePee

Solution:

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

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        char[] chars = in.readLine().toCharArray();
        int P = 0, A = 0, T = 0, e = 0, s = 0, t = 0;
        for (char aChar : chars) {
            if (aChar == 'P') P++;
            else if (aChar == 'A') A++;
            else if (aChar == 'T') T++;
            else if (aChar == 'e') e++;
            else if (aChar == 's') s++;
            else if (aChar == 't') t++;
        }
        StringBuilder sb = new StringBuilder();
        while (P != 0 || A != 0 || T != 0 || e != 0 || s != 0 || t != 0) {
            if (P > 0) {
                sb.append("P");
                P--;
            }
            if (A > 0) {
                sb.append("A");
                A--;
            }
            if (T > 0) {
                sb.append("T");
                T--;
            }
            if (e > 0) {
                sb.append("e");
                e--;
            }
            if (s > 0) {
                sb.append("s");
                s--;
            }
            if (t > 0) {
                sb.append("t");
                t--;
            }
        }
        System.out.println(sb);
    }
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        char[] chars = in.readLine().toCharArray();
        int P = 0, A = 0, T = 0, e = 0, s = 0, t = 0;
        for (char aChar : chars) {
            if (aChar == 'P') P++;
            else if (aChar == 'A') A++;
            else if (aChar == 'T') T++;
            else if (aChar == 'e') e++;
            else if (aChar == 's') s++;
            else if (aChar == 't') t++;
        }
        StringBuilder sb = new StringBuilder();
        while (P != 0 || A != 0 || T != 0 || e != 0 || s != 0 || t != 0) {
            if (P > 0) {
                sb.append("P");
                P--;
            }
            if (A > 0) {
                sb.append("A");
                A--;
            }
            if (T > 0) {
                sb.append("T");
                T--;
            }
            if (e > 0) {
                sb.append("e");
                e--;
            }
            if (s > 0) {
                sb.append("s");
                s--;
            }
            if (t > 0) {
                sb.append("t");
                t--;
            }
        }
        System.out.println(sb);
    }
}

Released under the MIT License.