[LeetCode] [Reverse Integer 2011-12-25 ]
2014-05-14 15:17
344 查看
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 s = x; if(x < 0) { s = s*(-1); } int r = 0; while(s!=0) { int tmp = s - (s/10)*10; r = r*10+tmp; s = s/10; } if(x<0) { r = r*(-1); } return r; } };
相关文章推荐
- 【Leetcode-easy】Reverse Integer
- leetcode之Reverse Integer
- [LeetCode] Reverse Integer 翻转整数
- leetcode: Reverse Integer 菜鸟解法
- 【LeetCode-Algorithm】【7-Reverse Integer】【Python】
- LeetCode 之 Reverse Integer
- 【LeetCode7】【Reverse Integer】java中整形正负表示的一些思考
- LeetCode 007: Reverse Integer
- LeetCode Reverse Integer
- 2---LeetCode【Reverse Integer】|C语言|总结
- LeetCode Reverse Integer 带考虑第二种特殊情况
- leetcode Reverse Integer & Palindrome Number
- LeetCode_7_ReverseInteger(翻转数字)
- LeetCode每日一练(7) Reverse Integer C++版
- leetcode:Reverse Integer 【Java】
- LeetCode Reverse Integer
- leetcode---reverse-integer---复杂度
- LeetCode Reverse Integer
- [Week 1]【Leetcode】Reverse Integer(逆序问题)
- LeetCode-7-Reverse Integer-颠倒整数