Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

public class M1 answer { public static String reverse1(String str) { return new StringBuffer(str).reverse().toString(); } public static int reverse(int n) { int ret = 0;

public class M1 answer

{ public static String reverse1(String str)

{ return new StringBuffer(str).reverse().toString(); }

public static int reverse(int n)

{ int ret = 0; String bString = String.valueOf(n); bString = reverse1(bString); ret = Integer.parseInt(bString); return ret; }

public static int palindroCount(int n)

{ int ret = 0; int re = reverse(n); while(re!=n)

{ if(ret>=10) return -1; n = re + n; ret++; re = reverse(n); } return ret; } public static void main(String[] args)

{ int n = 159; System.out.println(palindroCount(n)); } }

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

JDBC Database Programming With J2ee

Authors: Art Taylor

1st Edition

0130453234, 978-0130453235

More Books

Students also viewed these Databases questions