Answered step by step
Verified Expert Solution
Question
1 Approved Answer
M1// gai ming! public static int palindroCount( int n) { int result = 0; if (! isPalindrome (n)) { result = 1; while (! isPalindrome
M1// gai ming! public static int palindroCount(int n) { int result = 0; if (!isPalindrome(n)) { result = 1; while (!isPalindrome(n +invert(n))) { result++; n += invert(n); if (result > 10) result = -1; } } return result; } private static int invert(int n) { String invert = ""; String number = String.valueOf(n); for (int i = 0; i < number.length(); i++) { invert += number.charAt(number.length() - 1 - i); } return Integer.parseInt(invert); } private static boolean isPalindrome(int n) { boolean result = true; String number = String.valueOf(n); for (int i = 0; i < number.length(); i++) { if (number.charAt(i) != number.charAt(number.length() - 1 - i)) result = false; } return result; } public static void main(String[] args) { System.out.println(isPalindrome(11)); System.out.println(isPalindrome(1431)); System.out.println(isPalindrome(131)); System.out.println(invert(7654)); System.out.println(palindroCount(159)); }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started