@@ -0,0 +1,712 @@
+class Solution %7B%0A    public int reverse(int x) %7B%0A        int%5B%5D num = new int%5B20%5D;%0A        int len = 0;%0A        boolean flag = true;%0A        if (x %3C 0) %7B%0A            flag = false;%0A            x = -x;%0A        %7D%0A        while (x %3E 0) %7B%0A            num%5Blen%5D = x %25 10;%0A            len++;%0A            x /= 10;%0A        %7D%0A        int result = 0;%0A        for (int i=0; i%3Clen; i++) %7B%0A            result = result*10 + num%5Bi%5D;%0A            if (result%2510 != num%5Bi%5D) return 0;%0A        %7D%0A        if (!flag) result = -result;%0A        return result;%0A    %7D%0A%7D%0A%0Apublic class reverse_integer %7B%0A    public static void main(String%5B%5D args) %7B%0A        Solution s = new Solution();%0A        System.out.println(s.reverse(1534236469));%0A    %7D%0A%7D

add https://leetcode.com/problems/reverse-integer/