【LeetCode刷题】--9.回文数

9.回文数

class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0){
            return false;
        }
        int tmp = x, sum = 0;
        boolean flag = false;
        while(x != 0){
            sum = sum * 10 + x % 10;
            x /= 10;
        }
        if(sum == tmp){
            flag = true;
        }
        return flag;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17