【PAT】【大整数加法+字符串方式实现】1024 Palindromic Number (25 分)

题目链接：1024 Palindromic Number (25 分)

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 (≤10​10​​) 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

 // 大整数加法

// 解题思路：

// 一：将数据按位存入整型数组，模拟加法运算，每次运算后判断是否为回文数

// 二：直接用字符串表示数组，在字符数组上运算，节省代码量，第二种的实现更优也更方便判断回文数

// ！注意！：测试点2、3：判断要在最前面判断，因为可能一开始本身就是回文数

 // 第一种代码：

// 第一种代码：
int num1[200], num2[200];
// 判断是否为回文数
bool judge(const int &n)
{
    for(int i = 0; i < n / 2; i++)
    {
        if(num1[i] != num1[n - 1 - i])
        {
            return false;
        }
    }
    return true;
}
int main()
{
    // 字符串读入存入整型数组
    string a; cin >> a;
    for(int i = 0; i < a.size(); i++)
    {
        num1[i] = a[a.size() - 1 - i] - '0';
        num2[i] = a[i] - '0';
    }
    int n = a.size(), k;
    cin >> k;

    int step(0);
    while(step < k)
    {
        // ！注意：判断要在最前面判断，因为可能一开始本身就是回文数
        if(judge(n)) break;
        // 模拟加法
        int jin(0);
        for(int i = 0; i < n; i++)
        {
            num1[i] += num2[i] + jin;
            jin = 0;
            if(num1[i] > 9)
            {
                jin = num1[i] / 10;
                num1[i] %= 10;
            }
        }
        if(jin > 0) num1[n++] = jin;
        // 反向保存在另一个数组
        for(int i = 0; i < n; i++)
        {
            num2[i] = num1[n - 1 - i];
        }
        step++;
    }
    // 答案保存在num1数组，按要求输出即可
    for(int i = n - 1; i >= 0; i--)
    {
        printf("%d", num1[i]);
        if(i == 0) printf("\n");
    }
    printf("%d\n", step);
    return 0;
}

 // 第二种代码：(参考柳婼)

string s;
void add(string &t)
{
    int len = s.length(), carry = 0;
    for(int i = 0; i < len; i++)
    {
        s[i] += t[i] + carry - '0';
        carry = 0;
        if(s[i] > '9')
        {
            s[i] -= 10;
            carry = 1;
        }
    }
    if(carry) s += '1';
    reverse(s.begin(), s.end());
}
int main()
{
    int k, step(0);
    cin >> s >> k;
    for(int i = 0; i < k; i++, step++)
    {
        string t = s;
        reverse(t.begin(), t.end());
        if(s == t) break;
        add(t);
    }
    cout << s << endl << step << endl;
    return 0;
}