LeetCode 9. Palindrome Number

最新推荐文章于 2020-10-24 21:55:08 发布

wuqingdeqing

最新推荐文章于 2020-10-24 21:55:08 发布

阅读量104

点赞数

分类专栏：算法学习笔记文章标签： LeetCode 算法刷题

本文链接：https://blog.csdn.net/wuqingdeqing/article/details/97104084

版权

算法学习笔记专栏收录该内容

50 篇文章 0 订阅

订阅专栏

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?

此题逻辑极为简单，Accepted代码如下：

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

此解法RT小于61.6%，但空间居然仅小于7.64%的人，这实在令我费解，暂时还未发现有什么特别省空间的操作。