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.

Sample Input 1:

67 3

Sample Output 1:

484
2

Sample Input 2:

69 3

Sample Output 2:

1353
3

 题意：给一个不超过10位数的数N，经过不大于k次变化（加上反转N），如果经过i次变化成回文数，则输出这个数和i，如果经过k次变化都不能变化成回文数，那么输出第k次变化后的数和k

思路：因为这个数不超过10位数，但是如果这个数为10位数，经过99次变化，那么可能超过long和int的范围，那么必须使用BigInteger类，

1.反转可以 先将大整数转为StringBuffer再使用reverse（）方法再转换为大整数类

2.判断回文可以 将大整数类转为String类 定义两个指针一个在前一个在后比较

代码：

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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        BigInteger n = sc.nextBigInteger();
        int k = sc.nextInt();
        for (int i = 0; i < k; i++) {
            if (isPalindromic(n.toString())) {
                System.out.println(n);
                System.out.println(i);
                return;
            }
            n=n.add(reverse(n.toString()));
        }
        System.out.println(n);
        System.out.println(k);
    }

    public static boolean isPalindromic(String s) {
        int l = 0, r = s.length() - 1;
        while (l < r) {
            if (s.charAt(l) != s.charAt(r)) return false;
            l++;
            r--;
        }
        return true;
    }

    public static BigInteger reverse(String s) {
        return new BigInteger(new StringBuffer(s).reverse().toString());
    }
}