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.

Follow up:

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

题解

该题不能将整数转换成字符串来解决。所以，我们需要将这个整数通过计算来进行反转，最后判断反转后的整数和原来的整数是否相等，结果就出来了。原本我是将整数反转后的结果存储在一个整形数组，然后将该数组对称扫描，发现两个的运行时间是差不多的，但是却损耗了一些额外的空间，后续看看能不能进行改进。

class Solution {
    public boolean isPalindrome(int x) {
        // 0-9的整数为回文整数
        if (x >= 0 && x < 10) return true;
        // 负整数和以0结尾的整数不属于回文整数
        if (x < 0 || x % 10 == 0) return false;
		// 获取反转后的整数
        int n = x, res = 0;
        while (n != 0) {
        	res *= 10;
        	res += n % 10;
        	n /= 10;
        }
        
        return res == x;
    }
}