@@ -0,0 +1,714 @@
+/***%0A * Divide two integers without using multiplication, division and mod operator.%0A *%0A * If it is overflow, return MAX_INT.%0A */%0Apublic class Solution %7B%0A    public int divide(int dividend, int divisor) %7B%0A        long a = dividend %3E= 0 ? dividend : - (long) dividend;%0A        long b = divisor %3E= 0 ? divisor : - (long) divisor;%0A%0A        long ret = 0;%0A        while (a %3E= b) %7B%0A            long c = b;%0A            for (int i = 0; a %3E= c; ++i, c %3C%3C= 1) %7B%0A                a -= c;%0A                ret += 1 %3C%3C i;%0A            %7D%0A        %7D%0A%0A        if (ret %3E Integer.MAX_VALUE && (dividend %3E 0 %5E divisor %3C 0))%0A            return Integer.MAX_VALUE;%0A        return (int)((dividend %3E 0 %5E divisor %3E 0) ? (-ret) : ret);%0A    %7D%0A%7D%0A

add DivideTwoIntegers.java