回文数

bool isPalindrome(int x) {
    if(x < 0) return false;
    int divided[40], ListSize;
    int *p = divided;
    while(x > 0) {
        *(p++) = x % 10;
        x /= 10;
    }
    ListSize = p - divided;
    for(int head = 0, tail = ListSize-1; head < tail; head++, tail--) if(divided[head] != divided[tail]) return false;
    return true;
}