LeetCode Reverse Integer
2014-09-11 19:06
281 查看
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
public class Solution {
public int reverse(int x) {
int temp=x;
int sum=0;
if (x<0) {
x=-x;
}
if (x==0) {
return 0;
}
while(x%10==0){
x=x/10;
}
while (x!= 0) {
sum=sum*10+x%10;
x=x/10;
}
if (temp>0) {
return sum;
}
return 0-sum;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode OJ Reverse Integer
- leetcode--reverse_integer
- LeetCode Reverse Integer
- LeetCode(7) Reverse Integer
- LeetCode——Reverse Integer
- leetcode(7) reverse integer
- LeetCode | Reverse Integer（翻转整数）
- LeetCode: Reverse Integer，Palindrome Number
- leetcode Reverse Integer 2.2 难度系数2
- leetcode 7 Reverse Integer（水题）
- Leetcode [Reverse Integer]
- leetcode002-数值处理Reverse Integer,Pow(x,n), atoi, Divide Two Integers
- LeetCode-7-Reverse Integer（Nmber-Strng）-Easy
- [LeetCode-7] Reverse Integer（反转整数）
- Reverse Integer -- LeetCode
- Leetcode Reverse Integer
- Reverse Integer--LeetCode(Java)
- 【leetcode】7—reverse integer
- Reverse Integer Leetcode 每日一题 ↖(^ω^)↗
- leetcode [Reverse Integer]