int reverse(int number)
{
//求出位数
int weishu = 0;
int temp = number;
do
{
temp /= 10;
weishu++;
} while (temp != 0);
//求出逆序数
int result = 0;
for (int i = 0; i < weishu; i++)
{
//得到末尾
int temp;
temp = number % 10;
number /= 10;//原数除去末尾
result = result * 10 + temp;//结果乘10+末尾
}
return result;
}
优化后:(不求位数)
int nixu(int number)
{
int result = 0;
do
{
result = result * 10 + number % 10;
number /= 10;
} while (number != 0);
return result;
}