Leetcode(18) - Reverse Integer
2017-06-24 23:31
375 查看
https://leetcode.com/problems/reverse-integer/#/description
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Solution:
反转数字，这里偷了个懒，用了Long来解决overflow问题。
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Solution:
反转数字，这里偷了个懒，用了Long来解决overflow问题。
int ReverseInteger::reverse(int x) {
long base = 0;
while (x) {
base = base * 10 + x % 10;
x /= 10;
}
return (base < INT_MIN || base > INT_MAX) ? 0 : base;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [Leetcode]Reverse Integer
- leetcode-7 Reverse Integer
- [LeetCode]Reverse Integer
- leetcode 18. 4Sum
- Leetcode 7 Reverse Integer
- leetcode 7 -- Reverse Integer
- LeetCode 007 Reverse Integer
- leetcode 18. 4Sum
- LeetCode --Reverse Integer
- LeetCode 18. 4Sum
- [LeetCode 7] Reverse Integer
- leetcode18:4Sum
- 算法分析与设计课程（18）：【leetcode】Clone Graph
- LeetCode之7 --- Reverse Integer
- <LeetCode OJ> (1 / 15 / 16 / 18) NSum问题集合
- [LeetCode 007] Reverse Integer
- 【LeetCode】Reverse Integer
- [LeetCode] Reverse Integer
- [leetcode]18. 4Sum
- [LeetCode]1 Reverse Integer