题目内容

7.Reverse Interger
Reverse digits of an integer.

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

click to show spoilers.

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.

代码示例

#include<limits.h>
class Solution {
public:
int reverse(int x) {
long long sum = 0;
while(x != 0)
{
int temp = x % 10;
sum = sum * 10 + temp;
x/=10;
}
if (sum>INT_MAX||sum<INT_MIN)
return 0;
return (int)sum;
}
};
• 本文已收录于以下专栏：

举报原因： 您举报文章：[LeetCode 7]Reverse Integer(处理整数溢出） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)