【Leetcode】 #7 Reverse Integer

 1 public static int reverse(int x) {
 2         boolean isNegative=false;
 3         if(x<0){
 4             isNegative=true;
 5             x*=-1;
 6         }
 7         if(x>0x7FFFFFFF)
 8             return 0;
 9         int result=0;
10         boolean bigin=false;
11         int y=0;
12         while(x>0){
13             y=x%10;
14             x/=10;
15             if(y!=0){
16                 bigin=true;
17             }
18             if(bigin){
19                 if(result>214748364||(result==214748364&&y>7))   //防止调转过来溢出
20                     return 0;
21                 result*=10;
22                 result+=y;
23             }
24         }
25         if(isNegative)
26             result*=-1;
27         return result;
28     }