回文数(一)

解题思路:

注意事项:

import java.util.Scanner;

public class Demo1201 {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

while (scanner.hasNext()) {

int n = scanner.nextInt();

while (n-- > 0) {

int m = scanner.nextInt();

int sum = 0;

int step = 0;

while (true) {

int c = reverse(m);

m += c;

if (ishuiwen(m)) {

step++;

System.out.println(step);

break;

}

step++;

if (step > 8) {

System.out.println("0");

break;

}

}

}

}

}

//写一个将数字返回为一个反转数字的方法

public static int reverse(int a) {

String string = a + "";

String temp = "";

for (int i = string.length() - 1; i >= 0; i--) {

temp += string.charAt(i);

}

return Integer.parseInt(temp);

}

//写一个判断是否是回文数的方法

public static boolean ishuiwen(int a) {

String string = a + "";

String temp = "";

for (int i = string.length() - 1; i >= 0; i--) {

temp += string.charAt(i);

}

if (string.equals(temp)) {

return true;

} else {

return false;

}

}

}