# 7. Reverse Integer 一个简单但是非常考察思维全面性的题目。

Reverse digits of an integer.

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

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.

class Solution {
public:
int reverse(int x) {
int ans = 0;
int temp;
while(x){
temp = ans * 10 + x % 10;
if(temp / 10 != ans) return 0;//如果temp overflow，return 0
ans = temp;
x /= 10;
}
return ans;
}
};

#### 7. Reverse Integer [easy] (Python)

2016-07-26 21:50:37

#### 7. Reverse Integer 反转int

2016-05-06 09:48:57

#### LeetCode题目7. Reverse Integer

2017-06-03 18:06:35

#### LeetCode | 7. Reverse Integer

2017-06-15 10:45:06

#### 【LeetCode】 7. Reverse Integer

2017-08-24 22:37:24

#### LeetCode - 7. Reverse Integer

2016-06-30 13:22:05

#### [leetcode]7. Reverse Integer

2016-10-10 22:47:49

#### [LeetCode-Java]7. Reverse Integer

2016-09-19 21:00:36

#### LeetCodeOJ——7. Reverse Integer

2016-09-13 20:52:54

#### [LeetCode] 7. Reverse Integer

2016-07-14 13:39:57