首页 > itarticle > palindrome number 题目描述 例子 代码 总结

palindrome number 题目描述 例子 代码 总结

admin 11月 11, 2020 0

https://leetcode.com/problems/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.

代码

解法一

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
class Solution {
public:
    bool isPalindrome(int x) {
        if(x < 0) return false;
        if(x == 0 ) return true;
        int temp = x;
        long result = 0;
        result += temp % 10;
        temp /= 10;
        while(temp > 0){
            result *= 10;
            result += temp % 10;
            temp /= 10;
        }
        return result == x;
        
        
    }
};

总结

简单题，还是通过long来判断溢出

微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能