实现正整数的倒序

                                  **## 如何实现数的倒序**

#include "stdafx.h"
#include<iostream>
using namespace std;


int main()
{
	int a;
	cin >> a;
	unsigned i = a;
	unsigned m = 0;
	while (i>0)
	{
		m = m * 10 + i % 10;     //提出最低位，同时实现倒序
		i /= 10;                //移除最低位，重新上述操作

	}
	cout << m;
    return 0;
}

//下为函数编写
int reverse(unsigned n) {
	unsigned i = n;
	unsigned m = 0;
	while (i>0)
	{
		m = m * 10 + i % 10;     
		i /= 10;                

	}
	return m;
}