leetcode学习笔记09 palindrome-number

问题

palindrome-number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Follow up: Could you solve it without converting the integer to a string?

Example 1:

Input: x = 121
Output: true

Example 2:

Input: x = -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: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Example 4:

Input: x = -101
Output: false

Constraints:

• $-2^{31}<=x<=2^{31}-1$

思考

判断是否是回文数字,输入是int.

首先,所有的负数都肯定不是. 然后,可以通过某种方式,依次取得最后和最前的数字进行比较.

比如, 1 2 3 4 2 1, 第一次比较1 和1 ,然后比较2 和2 然后比较3 和4 发现不相等,则返回false.

数字取最后一位很好做, 除10取余数就可以了, 但是取最前一位需要知道最大位数.

想复杂了. 最简单的办法是把数字倒过来, 去判断倒过来的这个数和输入的数是否相等.

方法1

时间复杂度$O(1)$
空间复杂度$O(1)$.

class Solution {
    public boolean isPalindrome(int x) {
    	// 小于0 返回false
        if(x < 0)
            return false;
        
        // 计算 x 按位倒装的数 r
        int r = 0,temp = x;
        while(temp != 0){
            r = r*10 + temp%10;
            temp /= 10;
        }
        return r == x;
    }
}