1024 Palindromic Number (java)

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

Non-palindromic numbers can be paired with palindromic ones via a series of operations. First, the non-palindromic number is reversed and the result is added to the original number. If the result is not a palindromic number, this is repeated until it gives a palindromic number. For example, if we start from 67, we can obtain a palindromic number in 2 steps: 67 + 76 = 143, and 143 + 341 = 484.

Given any positive integer N, you are supposed to find its paired palindromic number and the number of steps taken to find it.

Input Specification:

Each input file contains one test case. Each case consists of two positive numbers N and K, where N (≤1010) is the initial numer and K (≤100) is the maximum number of steps. The numbers are separated by a space.

Output Specification:

For each test case, output two numbers, one in each line. The first number is the paired palindromic number of N, and the second number is the number of steps taken to find the palindromic number. If the palindromic number is not found after K steps, just output the number obtained at the Kth step and K instead.

import java.math.BigInteger;
import java.util.Scanner;

public class PalindromeTester {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        BigInteger originalNumber = input.nextBigInteger(); // 存储初始输入数据
        int maxOperations = input.nextInt(); // 执行的最大次数

        for (int operationCount = 0; operationCount < maxOperations; operationCount++) {
            if (isPalindrome(originalNumber.toString())) { // 检查是否已是回文数
                System.out.println(originalNumber);
                System.out.println(operationCount);
                return; // 如果是回文数，打印并结束程序
            }
            originalNumber = addReversed(originalNumber, originalNumber.toString()); // 否则，加翻转数
        }
        System.out.println(originalNumber);
        System.out.println(maxOperations); // 如果达到最大次数，打印最终数字和次数
    }

    public static boolean isPalindrome(String numberStr) {
        int leftIndex = 0;
        int rightIndex = numberStr.length() - 1;
        while (leftIndex < rightIndex) {
            if (numberStr.charAt(leftIndex) != numberStr.charAt(rightIndex)) {
                return false; // 如果字符不匹配，不是回文
            }
            leftIndex++;
            rightIndex--;
        }
        return true; // 如果所有字符匹配，是回文
    }

    public static BigInteger addReversed(BigInteger number, String numberStr) {
        BigInteger reversed = new BigInteger(new StringBuffer(numberStr).reverse().toString());
        return number.add(reversed); // 返回原数和反转数的和
    }
}