Leetcode 29-Medium-Divide-Two-Integers

Python Solution

Author: kyle8998

README.md

@@ -25,6 +25,7 @@ Personal Practice Set - Doing One a Day (sometimes) in a Variety of Languages!!
 | 26 | Easy       | [Remove Duplicates from Sorted Array](leetcode/26-Easy-Remove-Duplicates-From-Sorted-Array/problem.md) | [C](leetcode/26-Easy-Remove-Duplicates-From-Sorted-Array/answer.c), [Python](leetcode/26-Easy-Remove-Duplicates-From-Sorted-Array/answer.py) |
 | 27 | Easy       | [Remove Element](leetcode/27-Easy-Remove-Element/problem.md)                                 | [Python](leetcode/27-Easy-Remove-Element/answer.py)              |
 | 28 | Easy       | [Implement strStr()](leetcode/28-Easy-Implement-strStr/problem.md)                           | [C](leetcode/28-Easy-Implement-strStr/answer.c), [Python](leetcode/28-Easy-Implement-strStr/answer.py) |
+| 29 | Medium     | [Divide Two Integers](leetcode/29-Medium-Divide-Two-Integers/problem.md)                     | [Python](leetcode/29-Medium-Divide-Two-Integers/answer.py)       |
 | 35 | Easy       | [Search Insert Position](leetcode/35-Easy-Search-Insert-Position/problem.md)                 | [Go](leetcode/35-Easy-Search-Insert-Position/answer.go), [Java](leetcode/35-Easy-Search-Insert-Position/answer.java), [JavaScript](leetcode/35-Easy-Search-Insert-Position/answer.js), [Scala](leetcode/35-Easy-Search-Insert-Position/answer.scala) |
 | 36 | Medium     | [Valid Sudoku](leetcode/36-Medium-Valid-Sudoku/problem.md)                                   | [Python](leetcode/36-Medium-Valid-Sudoku/answer.py)              |
 | 53 | Easy       | [Maximum Subarray](leetcode/53-Easy-Maximum-Subarray/problem.md)                             | [Java](leetcode/53-Easy-Maximum-Subarray/answer.java)            |

leetcode/29-Medium-Divide-Two-Integers/answer.py

@@ -0,0 +1,28 @@
+#!/usr/bin/python
+
+#------------------------------------------------------------------------------
+
+class Solution:
+    def divide(self, dividend, divisor):
+        """
+        :type dividend: int
+        :type divisor: int
+        :rtype: int
+        """
+        positive = (dividend < 0) is (divisor < 0)
+        dividend, divisor = abs(dividend), abs(divisor)
+        res = 0
+        while dividend >= divisor:
+            temp, i = divisor, 1
+            while dividend >= temp:
+                dividend -= temp
+                res += i
+                i <<= 1
+                temp <<= 1
+        if not positive:
+            res = -res
+        return min(max(-2147483648, res), 2147483647)
+        
+
+#------------------------------------------------------------------------------
+#Testing

leetcode/29-Medium-Divide-Two-Integers/problem.md

@@ -0,0 +1,18 @@
+# Problem 29: Divide Two Integers
+
+
+#### Difficulty: Medium
+
+#### Problem
+
+Divide two integers without using multiplication, division and mod operator.
+
+If it is overflow, return MAX_INT.
+
+#### Example
+
+<pre>
+
+Division
+
+</pre>