leetcode之Reverse Integer

Reverse Integer

  Total Accepted: 66402  Total Submissions: 246671 My Submissions

Question  Solution 

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Update (2014-11-10):
Test cases had been added to test the overflow behavior.

此题的纠结处在于越界处理，凡是越界的都要返回0.Int型的范围是-2147483647到2147483647，所以为了防止越界，在判断的过程中要加入条件以防止越界。

代码如下：

#include "stdafx.h"


int reverse(int x);
int reverseTheNumber(int x);


int _tmain(int argc, _TCHAR* argv[])
{
int res1 = reverse(1563847412);
return 0;
}


int reverse(int x) 
{
int res = 0;
if (x >= 0)
{
res = reverseTheNumber(x);
}
else
{
res = (-1)*reverseTheNumber(-1 * x);
}
return res;
}
int reverseTheNumber(int x)
{
unsigned long int sum = 0;
unsigned int temp = 0;
unsigned int i = 1;
while (x > 0)
{


temp = x % 10;
sum = sum * 10 + temp;
x = x / 10;
if ((sum > 214748364 && x > 7) || (sum >= 214748365 && x > 0))
return 0;
}
return sum;
}