Leetcode-7 Reverse Integer
2016-12-16 02:16
381 查看
#7. Reverse Integer
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
题解：暴力做，注意边界：
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
题解：暴力做，注意边界：
class Solution {
public:
int reverse(int x) {
long long num=abs(x);
long long ret=0;
int tmp=0;
while(num>9)
{
tmp=num%10;
ret=ret*10+tmp;
num/=10;
}
ret=ret*10+num;
if(ret>INT_MAX||x==INT_MIN)
return 0;
else if(x<0)
return -ret;
else
return ret;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【leetcode】Reverse Integer
- leetcode - Reverse Integer
- Leetcode 7 - Reverse Integer
- 【leetcode】Reverse Integer
- [LeetCode] Reverse Integer
- Leetcode: Reverse Integer
- LeetCode 7 Reverse Integer
- LeetCode:Reverse Integer
- [Leetcode 14] 7 Reverse Integer
- 【LeetCode】LeetCode——第7题：Reverse Integer
- LeetCode - Reverse Integer
- LeetCode Reverse Integer
- [leetcode 7] Reverse Integer
- 【leetcode with java】7 Reverse Integer
- Leetcode代码学习周记——Reverse Integer
- leetcode-7 Reverse Integer
- [Leetcode]-Reverse Integer
- LeetCode | 7)Reverse Integer
- LeetCode 7 - Reverse Integer
- [LeetCode]Reverse Integer