一個小小工程師的心情抒發天地

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2³¹,  2³¹ − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

 


#include 
using namespace std;


int reverse(int x) 
{
	int ans = 0;
	while (x)
	{
		int temp = ans * 10 + x % 10;
		if (temp / 10 != ans)
			return 0;
		ans = temp;
		x /= 10;
	}
	return ans;
}


int main()
{
	int ans = 0; 
	while (1)
	{
		cin >> ans;
		cout << reverse(ans) << endl;
	}
}