-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPalindromeNumber.java
42 lines (38 loc) · 1.04 KB
/
PalindromeNumber.java
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
30
31
32
33
34
35
36
37
38
39
40
41
42
package jpa.example.demo.algo;
/**
* Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
*
* Example 1:
*
* Input: 121
* Output: true
* Example 2:
*
* Input: -121
* Output: false
* Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
* Example 3:
*
* Input: 10
* Output: false
* Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
*/
public class PalindromeNumber {
public static boolean isPalindrome(int x) {
String rawString = String.valueOf(x);
int left = 0, right = rawString.length() - 1;
while (left <= right) {
if (rawString.charAt(left) == rawString.charAt(right)) {
left++;
right--;
} else {
return false;
}
}
return true;
}
public static void main(String[] args) {
int x = 10;
System.out.println(isPalindrome(x));
}
}