[leetcode] Reverse Integer
2017-05-29 05:03
330 查看
Reverse digits of an integer.
Example1: x = 123, return 321 Example2: x = -123, return -321
Analysis & Solution
public int reverse(int x) {
long res = 0; //need to consider the overflow problem
while(x != 0){
res = res * 10 + x % 10; // -11%10 = -1
if(res > Integer.MAX_VALUE || res < Integer.MIN_VALUE){
return 0;
}
x = x/10;
}
return (int)res;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【Leetcode】Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode--Reverse Integer
- leetcode 7 Reverse Integer
- LeetCode 007 Reverse Integer
- LeetCode-007 Reverse Integer
- [LeetCode] 7. Reverse Integer
- [LeetCode][Java] Reverse Integer
- [Leetcode] #7 Reverse Integer
- LeetCode题解：Reverse integer
- LeetCode 7 Reverse Integer
- 【Leetcode】Reverse Integer
- [LeetCode 007] Reverse Integer
- leetcode:Reverse Integer
- [Leetcode 7, Easy] Reverse integer
- leetcode - Reverse Integer
- Leetcode-7: Reverse Integer
- [leetcode] Reverse Integer
- leetcode第七题--Reverse Integer
- LeetCode 007 Reverse Integer