Leetcode5: Reverse Integer
2015-04-11 15:03
288 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
给出大牛的解法,这题实在不知道怎么解,原谅LZ的智障 -。-
Example1: x = 123, return 321
Example2: x = -123, return -321
给出大牛的解法,这题实在不知道怎么解,原谅LZ的智障 -。-
class Solution { public: int reverse(int x) { int sign = x > 0 ? 1:-1; long temp = 0; while(x) { temp = temp*10 + x%10; x /= 10; } if(temp > 2147483647 || sign*temp > 2147483647) return 0; else { return temp; } } };
其中2147483647是2的31次方-1,是32位操作系统中最大的符号型整型常量。所以这里一定要有判断,否则会溢出。
相关文章推荐
- Leetcode 7 - Reverse Integer
- 【Leetcode】Reverse Integer
- [LeetCode] Reverse Integer
- leetcode_Reverse Integer
- [leetcode] Reverse Integer
- [LeetCode]Reverse Integer
- 【LeetCode】LeetCode——第7题:Reverse Integer
- 【Leetcode】【python】Reverse Integer
- Leetcode_7_Reverse Integer
- (leetcode) Reverse Integer
- 【leetcode with java】7 Reverse Integer
- [Leetcode]-Reverse Integer
- Leetcode Reverse Integer
- 【LeetCode】Reverse Integer
- LeetCode | 7)Reverse Integer
- LeetCode 7 - Reverse Integer
- 【LeetCode】Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode - Reverse Integer
- [LeetCode]007-Reverse Integer