[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.

[运行结果]
Runtime: 6 ms, faster than 100.00% of Java online submissions for Palindrome Number.
Memory Usage: 35.7 MB, less than 37.65% of Java online submissions for Palindrome Number.
[代码]

class Solution {
    public boolean isPalindrome(int x) {
        boolean result = false;
        int reverse = 0;
        int temp = x;
        if(x>=0)
        {
            while(temp != 0)
            {  
                int num = temp%10;
                temp /= 10;
                reverse *= 10;
                reverse += num;
            }
            if(reverse + x == 2*x)
            {
                result = true;
            }
            else {
                result = false;
            }
        }
        else {
            result = false;
        }
        
        return result;
    }
}