Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
29 lines (24 loc) · 585 Bytes

File metadata and controls

29 lines (24 loc) · 585 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
import java.util.Scanner;
import java.util.Scanner;
public class Palindrome {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int rev= reverse(n);
if(rev==n){
System.out.println("Palindrome");
}
else{
System.out.println("Not a Palindrome");
}
}
public static int reverse(int n){
int rev=0;
while(n>0){
int r= n%10;
n=n/10;
rev = rev*10 + r;
}
return rev;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.