LeetCode 9: Palindrome Number

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/itnerd/article/details/82779494

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.

Follow up:

Coud you solve it without converting the integer to a string?

my solution:

class Solution {
    public boolean isPalindrome(int x) {
        
        if(x<0)return false;
        if(x==0)return true;
        int rev = 0;
        int bak = x;
        while(x>0){
            rev = rev*10+x%10;
            x = x/10;
        }
        return bak==rev;
    }
}

题目地址：
https://leetcode.com/problems/palindrome-number/description/