LeetCode Reverse Integer
2014-03-17 10:42
253 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Example1: x = 123, return 321
Example2: x = -123, return -321
class Solution {
public:
int reverse(int x) {
int sign;
sign = x > 0 ? 1 : -1;
int absx;
absx = x > 0 ? x : -x;
int result = 0;
while(absx) {
result = result * 10 + absx % 10;
absx /= 10;
}
return sign*result;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode]:Reverse Integer(Only两类解法)
- leetcode：Reverse Integer（反转数字）【算法面试题】
- 007 Reverse Integer [Leetcode]
- LeetCode之Reverse Integer
- leetcode Reverse Integer
- LeetCode - Reverse Integer - Frequent
- Leetcode_Reverse Integer（考虑了溢出情况）
- 【LeetCode】(7)Reverse Integer(Easy)
- 【python】【leetcode】【算法题目7—Reverse Integer】
- Reverse Integer(leetcode)
- LeetCode: Reverse Integer
- Leetcode Reverse Integer
- leetcode_07_Reverse Integer (easy)
- Reverse Integer leetcode python
- LeetCode: Reverse Integer
- LeetCode-7 Reverse Integer(倒置整型数)
- leetcode Reverse Integer
- LeetCode Reverse Integer
- Reverse Integer 翻转数字@LeetCode
- [LeetCode] Reverse Integer 解题报告