递归 将一个整数逆序

//将一个整数int倒转过来
#include <iostream>
using namespace std;

//利用引用
void IntRev(int nsrc, int &ndes)
{
	if (0 == nsrc)
	{
		return;
	}
	else
	{
		ndes = ndes*10 + nsrc%10;
		IntRev(nsrc/10, ndes);
	}
}

//利用局部static变量只初始化一次的特性
int IntRev2(int num)
{
	static int ret = 0;
	if (0 == num)
	{
		return ret;
	}
	else
	{
		ret = ret*10+num%10;
		return IntRev2(num/10);
	}
}

int main(int argc, char *argv[])
{
	int nInt = 256425;
	int nOut = 0;

	//firt
	IntRev(nInt, nOut);
	cout<<"int number: "<<nInt<<", reverse: "<<nOut<<endl;

	//second
	nInt = 456624;
	cout<<"int number: "<<nInt<<", reverse: "<<IntRev2(nInt)<<endl;

	return 0;
}