leetcode-9 Palindrome Number

Posted tingweichen

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.
想法:先将整数型转变成字符型,然后反转,再去和原字符比较。
class Solution {
public:
    bool isPalindrome(int x) {
        string s = to_string(x);
        string temp = s;
        reverse(s.begin(),s.end());
        return temp ==  s;
    }
};

以上是关于leetcode-9 Palindrome Number的主要内容,如果未能解决你的问题,请参考以下文章

#Leetcode# 9. Palindrome Number

LeetCode 9. Palindrome Number

LeetCode - 9 - Palindrome Number

Leetcode:9- Palindrome Number

leetcode-9 Palindrome Number

Leetcode 9. Palindrome Number