[LeetCode]Reverse Integer
2017-05-17 10:27
393 查看
题目：
Reverse digits of an integer.Example1: x = 123, return 321
Example2: x = -123, return -321
代码
//解决方案比较简单，直接看代码即可
class Solution {
public int reverseInteger(int origin) {
boolean isNegative = false;
if (origin < 0) {
isNegative = true;
origin = -origin;
}
int result = 0;
while (x>0) {
int temp = x%10;
result = result*10;
result = result+temp;
x = x/10;
}
if(isNegative) {
return -result;
}
return result;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode题解：Reverse integer
- 【Leetcode】Reverse Integer
- leetcode_reverse Integer
- leetcode:Reverse Integer
- [Leetcode 7, Easy] Reverse integer
- leetcode - Reverse Integer
- [leetcode] 7 reverse integer
- leetcode 第7题 Reverse Integer
- [leetcode] Reverse Integer
- leetcode--Reverse integer
- Leetcode第七题_Reverse Integer
- leetcode第七题--Reverse Integer
- LeetCode之7 --- Reverse Integer
- Leetcode || Reverse Integer
- [LeetCode 007] Reverse Integer
- LeetCode 007 Reverse Integer
- LeetCode - E - Reverse Integer
- 【LeetCode】Reverse Integer
- LeetCode 7_Reverse Integer
- [LeetCode]#7 Reverse Integer