判断一个数m是否为对称数:
法一:
int k=m, tem = 0;
while(k) //求m的对称
{
tem = tem * 10 + k % 10;
k = k / 10;
}
if(tem == m) //判断m是不是对称数
{
...
}
法二:(容器使用,留存)
bool isSymmetry(int m)
{
vector<int> iVec;
while(m)
{
iVec.push_back(m % 10);
m /= 10;
}
size_t len = iVec.size() - 1;
for(size_t i = 0; i <= len/2; ++i)
{
if(iVec[i] != iVec[len - i])
{
return false;
}
}
return true;
}