leetcode7-Reverse Integer
2014-07-17 20:45
417 查看
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 y=x>=0?x:-x;
int nResult=0;
while(y/10>0)
{
nResult=nResult*10+y%10;
y=y/10;
}
nResult=nResult*10+y;
return x>=0?nResult:-nResult;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetCode(62)-Reverse Integer
- Leetcode - Reverse Integer
- leetcode笔记：Reverse Integer
- LeetCode-Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode Problem:Reverse Integer
- leetcode-Reverse Integer
- LeetCode | Reverse Integer
- [Leetcode]-Reverse Integer
- [LeetCode] Reverse Integer
- 【leetcode】Reverse Integer
- [LeetCode]Reverse Integer
- [LeetCode]Reverse Integer
- 【Leetcode】Reverse Integer
- LeetCode Reverse Integer
- [LeetCode]Reverse Integer
- LEETCODE-Reverse Integer
- LeetCode | Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode7:Reverse Integer