0%

Leetcode009 Palindrome Number

Posted on In Valine:

Problem:

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.

Solution:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
public boolean isPalindrome(int x) {
       if(x < 0){
           return false;
       }
       
       int a = 0;
       int b = x;
       while(x > 0){
           int mod = x % 10;
           a = a * 10 + mod;
           x = x / 10;
       }
       
       if(b == a){
           return true;
       }
       return false;
   }