LeetCode Reverse Integer
2015-01-07 09:48
190 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Show Tags
题意：将数字反转
思路：注意要判断溢出就是了
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Show Tags
题意：将数字反转
思路：注意要判断溢出就是了
class Solution {
public:
int reverse(int x) {
long long ans = 0;
while (x) {
ans = ans * 10 + (x % 10);
x /= 10;
}
if (ans > INT_MAX)
ans = 0;
if (ans < INT_MIN)
ans = 0;
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 07 Reverse Integer
- leetcode Reverse Integer python
- leetcode->Reverse Integer
- Leetcode 7 Reverse Integer 将整数逆转
- Reverse Integer - Leetcode 算法详解
- LeetCode Reverse Integer、Palindrome Number
- leetcode：Reverse Integer
- LeetCode【7】.Reverse Integer--java实现
- LeetCode Reverse Integer（整数翻转）
- leetcode Reverse Integer
- [LeetCode]Reverse Integer
- leetcode-T7 Reverse digits of an integer
- ［LeetCode］Reverse Integer
- Reverse digits of an integer_Leetcode_#7
- LeetCode 7 - Reverse Integer
- LeetCode 7 Reverse Integer 这道题被血虐
- 【LeetCode 7】Reverse Integer(Python)
- 【leetcode-7】Reverse Integer(C语言)
- LeetCode之Reverse Integer
- leetcode 7: Reverse Integer