LeetCode-9 Palindrome Number

题目链接

C++

class Solution {
public:
    bool isPalindrome(int x) {
        char s[11];
        
        sprintf(s, "%d", x);
        
        int len = strlen(s);
        int mid = len / 2;
        for (int i = 0; i < mid; ++i)
        {
            if (s[i] != s[len - i - 1])
            {
                return false;
            }
        }
        return true;
    }
};

Python

class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        
        s = str(x)
        length = len(s)
        for i in range(0, length / 2):
            if s[i] != s[length - 1 - i]:
                return False
        return True