在CU上看到的一个算法

#include <stdio.h>

int main(void)
{
    int m = 1234321;
    int j = 0,i = 0;
    int n[20];
    int flag = 0;
    
    while( m % 10 != 0 ){
        n[i++] = m % 10;
        m /= 10;
    }
    
    i--;

    for( j = 0 ; j > i ; j++,i-- ){
        if( n[j] != n[i] ){
            flag = 1;
            break;
        }
    }
    
    if( flag == 1 )
        printf("not found.\n");
    else
        printf("got it.\n");
        
    return 0;
}