(模板)回文数判断

树下

2018-09-16 18:26:21

Personal

``` int huiwen(int x){ int newed,n; newed=0; n=x; while(x>0){ newed=newed*10+x%10; x/=10; } if(n==newed) return 1; else return 0; } ```