c++最简单方法—递归

解题思路:
每次刷新需要判断回文的数，进入下次递归进行判断
注意事项:
输出一次res就要给他重新刷新为0
参考代码:

#include<iostream>

using namespace std;

int  res = 0;

int n;

void  fun(int x)

{

if (res > 8)

{

cout << "0"<<endl;

res = 0;

return;

}

int temp = x;

int s = 0;

while (temp)

{

s= s * 10 + temp % 10;

temp = temp / 10;

}

if (s == x)

{

cout << res << endl;

res = 0;

return;

}

else

{

res++;

return fun(x + s);

}

}

int main()

{

int s = 0;

cin >> s;

while (s--)

{

cin >> n;

fun(n);

}

return 0;

}