【LeetCode 9. Palindrome Number】（回文数判断）

题目链接
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.

思路：
判断一个int类型的数是否是回文数。 由于输入的是数，直接判断即可。
若是字符串，可以利用栈来写。

Code：

import java.util.HashMap;

public class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
            return false;
        }
        int reveNum = 0;
        int tmp = x;
        while (x != 0) {
            reveNum = reveNum * 10 + x % 10;
            x /= 10;
        }
        return tmp == reveNum;
    }

    public static void main(String[] args) {
        int x = 121;
        boolean res = new Solution().isPalindrome(x);
        System.out.println(res);
    }
}