LeetCode (Reverse Integer)
2017-03-29 09:08
417 查看
Problem:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
Answer:
class Solution {
public:
int reverse(int x) {
long long ans=0;
while (x){
ans = ans*10 + x%10;
x/=10;
}
return ans>INT_MAX||ans<INT_MIN?0:ans;
}
};
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
Answer:
class Solution {
public:
int reverse(int x) {
long long ans=0;
while (x){
ans = ans*10 + x%10;
x/=10;
}
return ans>INT_MAX||ans<INT_MIN?0:ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode Reverse Integer
- LeetCode Reverse Integer
- leetcode 7&9 : Reverse Integer & Palindrome Number
- 【leetcode-7】Reverse Integer(C语言)
- leetcode：Reverse Integer（一个整数反序输出）
- 《leetcode》reverse-integer
- LeetCode Reverse Integer
- LeetCode 之 Reverse Integer — C++ 实现
- [leetcode]Reverse Integer
- leetcode Reverse Integer
- Leetcode Reverse Integer 反转整数
- leetcode：Reverse digits of an integer
- LeetCode--Reverse Integer（整数反转）Python
- leetcode Reverse Integer 2.2 难度系数2
- LeetCode 7 Reverse Integer 这道题被血虐
- [Leetcode] reverse integer 反转整数
- LEETCODE: Reverse Integer
- Reverse Integer -- leetcode
- LeetCode（7）Reverse Integer
- LeetCode 7 : Reverse Integer (Java)