@@ -0,0 +1,752 @@
+/**%0A * https://oj.leetcode.com/problems/divide-two-integers/%0A * Divide two integers without using multiplication, division and mod operator.%0A */%0Apublic class DivideTwoIntegers %7B%0A    public int divide(int dividend, int divisor) %7B%0A        if (divisor == 0) return 0;%0A        int sign = 1;%0A        if (dividend %3C 0) %7B%0A            sign *= -1;%0A        %7D%0A        if (divisor %3C 0) %7B%0A            sign *= -1;%0A        %7D%0A        int res = 0;%0A        long a = dividend %3E 0 ? dividend : dividend;%0A        long b = divisor %3E 0 ? divisor : -divisor;%0A        while (a %3E= b) %7B%0A            long t = b;%0A            for (int i = 1; a %3E= t; t %3C%3C= 1, t %3C%3C= 1) %7B%0A                a = a - t;%0A                res += i;%0A            %7D%0A        %7D%0A        return sign * res;%0A    %7D%0A%7D%0A

Divide Two Integers