leetCode/PalindromeNumber.java at master · rahul-tasker/leetCode · GitHub

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
/*
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.
*/

class Solution {
    public boolean isPalindrome(int x) {
        String numAsStr = Integer.toString(x);
        if(numAsStr.length() == 1) {
            return true;
        }
        if(x < 0) {
            return false;
        }
        for(int i = 0; i < numAsStr.length(); i ++) {
            if(numAsStr.charAt(i) != numAsStr.charAt(numAsStr.length() - (i+1))) {
                return false;
            }
        }
        return true;
    }
}