Finding the word whether its Palindromic had been discussed in the past.How about numbers? and that without using String or character array?I wrote a program but its rather brut force.i.e. comparing quotient with remainder and reducing the number and repeating till middle one. Any other better approach?
MH
Marcel de Jong
Ranch Hand
Joined: May 27, 2002
Posts: 54
posted
0
Hi Capablanca, how about reducing the original number with it reverse? This should always result in zero (0). If not, you don't have a palindrome. Regards, Marcel
Arjun Shastry
Ranch Hand
Joined: Mar 13, 2003
Posts: 1828
posted
0
I think this will increase one additional step.bcos brut force,we are doing the same thing.
Nick George
Ranch Hand
Joined: Nov 17, 2003
Posts: 38
posted
0
you could always cheat... String s=(new Integer(1881)).toString();