@@ -0,0 +1,1029 @@
+%22%22%22Leetcodee 29. Divide Two Integers%0AMedium%0A%0AURL: https://leetcode.com/problems/divide-two-integers/%0A%0AGiven two integers dividend and divisor, divide two integers without using %0Amultiplication, division and mod operator.%0A%0AReturn the quotient after dividing dividend by divisor.%0A%0AThe integer division should truncate toward zero.%0A%0AExample 1:%0AInput: dividend = 10, divisor = 3%0AOutput: 3%0A%0AExample 2:%0AInput: dividend = 7, divisor = -3%0AOutput: -2%0A%0ANote:%0ABoth dividend and divisor will be 32-bit signed integers.%0AThe divisor will never be 0.%0AAssume we are dealing with an environment which could only store integers within%0Athe 32-bit signed integer range: %5B%E2%88%922%5E31,  2%5E31 %E2%88%92 1%5D. %0AFor the purpose of this problem, assume that your function returns 2%5E31 %E2%88%92 1 %0Awhen the division result overflows.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def divide(self, dividend, divisor):%0A        %22%22%22%0A        :type dividend: int%0A        :type divisor: int%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc029_divide_two_integers.py