作者:disappearedgod
时间:2014-4-28
题目
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
思路
代码
public class Solution {
public int reverse(int x) {
boolean pos = true;
if(x<0){
pos = false;
x *= -1;
}
/*
else if(x == 0){
return 0;
}*/
int res = 0;
while(x > 0){
int flag = x % 10;
res = 10 * res + flag;
x /= 10;
}
if(!pos)
res *= -1;
return res;
}
}
结果
Submit Time | Status | Run Time | Language |
---|---|---|---|
3 minutes ago | Accepted | 480 ms | java |
返回
LeetCode Solution(持续更新,java>c++)