LeetCode:Reverse Integer
2017-08-05 21:37
316 查看
题目:
Reverse digits of an integer.反转整数
思路:
可与INT_MIN和INT_MAX比较判断溢出。代码:
class Solution {
public:
int reverse(int x) {
long long res = 0;
while(x) {
res = res*10 + x%10;
x /= 10;
}
return (res<INT_MIN || res>INT_MAX) ? 0 : res;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode Reverse Integer python
- LeetCode 第 7 题(Reverse Integer)
- LeetCode 7 Reverse Integer 解题报告
- LeetCode Reverse Integer
- Leetcode在线编程 reverse-integer
- LeetCode--reverse-integer
- (LeetCode)Reverse Integer --- 反转整数
- [Leetcode] Reverse Integer
- leetcode(7) reverse integer
- leetcode---reverse-integer---复杂度
- LeetCode Reverse Integer
- Leetcode 07 Integer Reverse问题
- Reverse Integer--LeetCode(Java)
- leetcode Reverse Integer(Java)
- leetcode 7 Reverse Integer
- leetcode 75: Reverse digits of an integer.
- 【LeetCode】7 & 8 - Reverse Integer & String to Integer (atoi)
- Leetcode 7 Reverse Integer 数论
- LeetCode Reverse Integer
- leetcode Reverse Integer