Reverse integer rotation number

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x =-123, return-321

Local attention to positive and negative numbers is critical, and the Implementation part may not be optimal, according to your own ideas:

Set ret = 1; perform the remainder mod on X each time, and then ret = RET * 10 + MOD; (First let ret = mod), and finally return ret

The Code is as follows:

 1 public class Solution { 2     public int reverse(int x) { 3         int result = 0; 4         int flag = (x < 0) ? 1 : 0; 5          6         x = (x < 0) ? -x : x; 7          8         int first = 1; 9         while(x!=0){10             int mod = x%10;11             if(first == 1){12                 result = mod;13                 first = 0;14             }else{15                 result *= 10;16                 result += mod;17             }18             19             x /= 10;20             21         }22         23         return (flag == 1) ? -result : result;24         25     }26 }

 

Reverse integer rotation number