leetcode no9 - beyondnlp/nlp GitHub Wiki

bool isPalindrome(int x) {
    //12321
    int i, j;
    int buffer[1024];
    long int a=10, b, remain;
    if( x < 0 ) return false;
    for( i = 0; i < 1024; i++ ){
        remain=x % a;
        buffer[i]=remain/(a/10);
        b=a*10;
        if( a > x ) break;
        a = b;
    }
    for( j = 0; j < i; j++, i-- ){
        if( buffer[j] != buffer[i] ) return false;
    }
    return true;
}