#if 1
#include <iostream>
#include <math.h>
using namespace std;
int sort(int );
int main()
{
int n;
cout << "请输入一个整数:" << endl;
cin >> n;
cout << "逆序后为:" << sort(n) << endl;
return 0;
}
int sort(int n)
{
int count = 0,b = 0;
int i = 0;
int a[10] = {0};
int m = n;
while(0!=m)
{
m = m/10;
count++;
}
for(i = 0;i < count; i++)
{
a[i] = n / (int)pow(10,count-1-i);
n = n % (int)pow(10,count-1-i);
}
for(i = count-1;i >=0;i--)
{
b = b + a[i]*(int)pow(10,i);
}
return b;
}
#endif
下面这种算法没想到啊
#if 0
#include <iostream>
using namespace std;
int main()
{
int n,temp = 0,ot = 0;
cin >> n;
while(n%10||n/10)
{
temp = n%10;
n = n/10;
ot = ot*10 + temp;
}
cout << ot <<endl;
return 0;
}
#endif