LeetCode: 7. Reverse Interger【java 解题】

public class Solution {
public int reverse(int x) {

int res = x;
int [] cout = new int[11];
int i = 0;
if(x > 0)
res = x;
else
res = -x;
while(res > 0) {
cout[i] = res % 10;
res = res / 10;
i++;
}
res = 0;
for(int j = 0; j < i; j++) {
if(res > (Integer.MAX_VALUE - cout[j]) / 10)
return 0;
res = res * 10 + cout[j];
}

if(x > 0)
return res;
else
return -res;
}
}