0An easier way to find out whether a number is a Palindrome number or not.
Eg. 121, 88, 12321 etc
public boolean isPalindrome ( int n ) {
int rev = 0, r;
for( i = n; i > 0; i /= 10 ) {
r = i % 10;
rev = ( rev * 10 ) + r;
}
return rev == n;
}
Learn Programming Languages from the Best Tutors
Affordable fees 1-1 or Group class Flexible Timings Verified Tutors An easier way to find out whether a number is a Palindrome number or not.
Eg. 121, 88, 12321 etc
public boolean isPalindrome ( int n ) {
int rev = 0, r;
for( i = n; i > 0; i /= 10 ) {
r = i % 10;
rev = ( rev * 10 ) + r;
}
return rev == n;
}
Find Programming Languages Classes near you
Learn from Best Tutors on UrbanPro.
Are you a Tutor or Training Institute?
Join UrbanPro Today to find students near you10 Answers
5 Answers
