[LintCode] Reverse Integer
|
1 2 3 4 5 6 7 8 9 10 11 12 |
public int reverseInteger(int n) { // Write your code here int num = Math.abs(n); int res = 0; while(num != 0) { if(res > (Integer.MAX_VALUE - num%10) / 10) return 0; // corn case; res = res*10 + num %10; num /= 10; } return n > 0 ? res : -res; } |
Leave A Comment