Leetcode--reverse Integer

Reverse digits of an integer.

EXAMPLE1:X = 123, return 321
example2:x = -123, return-321

Problem Description: The entire number of 1000-bit reversed-order output.

Note Special cases:

1) Overflow condition: To check for Overflow/underflow, we could check if RET > 214748364 or ret <–214748364 before multiplying by Need to check if ret = = 214748364, why? On the other hand

2) positive numbers, negative numbers in addition to more than 10 10 of the situation;

3) 10,100 Such a number in reverse order can be used in general program processing.

Code:

 Public classSolution { Public intReverseintx) {intMax =Integer.max_value; intMin =Integer.min_value; Longres = 0;  while(x!=0){            intn = x%10; Res= Res *10 +N; X= X/10; if(Res>max | | res<min)return0; }        intRes1 = (int) Res; returnres1; }}

Leetcode--reverse Integer