LeetCode(9): 回文数

#include <string.h>
#include <stddef.h>
#include <stdio.h>
class Solution {
public:
    bool isHui(char *s)
    {
        size_t len = strlen(s);
        for(size_t i=0; i< len/2;i++)
            if(s[i] != s[len-1-i])
                return false;
        return true;
    }
    bool isPalindrome(int x) {
        char num[20];
        sprintf(num, "%d", x);
        return isHui(num);
    }
};