解题思路:
import java.util.Scanner; public class C1201 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); while(n-- > 0) F(sc.nextInt()); } sc.close(); } private static void F(int n){ int step = 0; String rs = String.valueOf(n); while(step <= 8){ step++; String reverse = new StringBuffer(rs).reverse().toString(); rs = String.valueOf(Integer.valueOf(rs) + Integer.valueOf(reverse)); if(isHuiWen(rs)) break; } if(step > 8) System.out.println(0); else System.out.println(step); } //判断是否为回文数 private static boolean isHuiWen(String str){ int len = str.length(); for(int i = 0; i < len/2; i++){ if(str.charAt(i) != str.charAt(len-1-i)) return false; } return true; } }
注意事项:
参考代码:
0.0分
0 人评分