Leetcode1-50: 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?

这题要求是判断给定的数字是不是回文串，题目问能否不把数字转换为字符串然后操作。

解题思路

逐位取数

按照顺序去除每一位数字最后得到一个新的数字，判断这个数字是否跟输入数字相等。注意需要考虑边界溢出情况

比较前后一半

只把后面一半数字取出得到数字，判断跟前半部分是否相等

代码实现

implement 1

    public boolean isPalindrome(int x) {
        //method1
        if(x<0) return false;
        if(x / 10 == Integer.MAX_VALUE / 10 && x % 10 != 2) return false; //判断边界情况
        int y = 0, xx = x;
        while(xx>0) {
            int tmp = xx % 10;
            xx /= 10;
            y = y*10 + tmp;
        }
        if(x == y) return true;
        else return false;

implement 2

public boolean isPalindrome(int x) {
        if(x < 0) return false;
        int length = (int)Math.log10(x) + 1;
        int secondHalf = 0;
        for(int i = 0; i < length / 2; i++) {
            secondHalf = secondHalf * 10 + x % 10;
            x = x / 10;
        }
        if(length % 2 != 0) x = x / 10;
        if(x == secondHalf) return true;
        else return false;
    }

复杂度分析

对于两种算法都是，时间复杂度O(log(x))，空间复杂度O(1）

分析

加油！快破两位数了hhh