C++ 中回文数判断简单实例

#include <iostream>  using namespace std;    void isHuiwen(int number)  {     int n = 0;//余数.    int m = number;   while(m != 0)    {      n = n*10 + m %10; //number的最低位变为n的最高位     m = m /10;    }     if(n==number)      cout << "yes" << endl;    else      cout << "no" << endl;  }    int main()  {    int number;    while(cin >> number)      isHuiwen(number);    return 0;  }