问Google Kickstart 2021轮A-K Goodness

EN

import java.util.Scanner;

class practice2 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int t = 0;
        do {
            t = input.nextInt(); // number of test cases
        } while (t < 1 || t > 100);
        int n = 0; // variable to store length of the string
        int k = 0; // variable to store the goodness number
        String s = "";
        for (int i = 0; i < t; i++) {
            do {
                n = input.nextInt(); // string length
            } while (n < 1 || n > 100);

            do {
                k = input.nextInt(); // goodness number
            } while (k < 0 || k > (n / 2));

            input.nextLine(); // clearing buffer
            do {
                s = input.nextLine();
            } while (s.length() != n);

            s = s.toUpperCase(); // in uppercase

            int minOp = checkGoodness(s, k, n);
            System.out.println("case #" + (i + 1) + ": " + minOp);
        }
    }

    public static int checkGoodness(String s, int k, int n) {
        char[] sArr = new char[s.length()];
        sArr = s.toCharArray();
        int score = 0; int minOp = 0;
        for (int i = 0; i < sArr.length / 2; i++) {
            if (sArr[i] != sArr[sArr.length - i - 1]) {
                score++;
            }
        }

        if ( score == k)
            minOp = 0;
        else
            minOp = Math.abs(score - k);

        return minOp;
    }
}