feat: Add python3 solutions for problem 24/29 (azl397985856#94)

* Fix solution on problem 88 with js, fixs azl397985856#62

* Fix solution on problem 88, fixs azl397985856#62

* Add python3 solution for problem 24

* Add python3 solution for problem 29.

* Fix python code format problem.

Author: kant-li

Diff for: problems/24.swapNodesInPairs.md

@@ -35,6 +35,9 @@ Given 1->2->3->4, you should return the list as 2->1->4->3.
 2. dummyHead简化操作
 
 ## 代码
+
+* 语言支持：JS，Python3
+
 ```js
 /*
  * @lc app=leetcode id=24 lang=javascript
@@ -94,3 +97,24 @@ var swapPairs = function(head) {
 };
 
 ```
+Python3 Code:
+```python
+class Solution:
+    def swapPairs(self, head: ListNode) -> ListNode:
+        """
+        用递归实现链表相邻互换：
+        第一个节点的next是第三、第四个节点交换的结果，第二个节点的next是第一个节点；
+        第三个节点的next是第五、第六个节点交换的结果，第四个节点的next是第三个节点；
+        以此类推
+        :param ListNode head
+        :return ListNode
+        """
+        # 如果为None或next为None，则直接返回
+        if not head or not head.next:
+            return head
+
+        _next = head.next
+        head.next = self.swapPairs(_next.next)
+        _next.next = head
+        return _next
+```

Diff for: problems/29.divide-two-integers.md

@@ -63,6 +63,8 @@ const isNegative = dividend > 0 !== divisor > 0;
 
 ## 代码
 
+* 语言支持：JS，Python3
+
 ```js
 
 
@@ -113,6 +115,58 @@ function helper(dividend, divisor) {
   return count + helper(last, divisor);
 }
 ```
+Python3 Code:
+```python
+class Solution:
+    def divide(self, dividend: int, divisor: int) -> int:
+        """
+        二分法
+        :param int divisor
+        :param int dividend
+        :return int
+        """
+        # 错误处理
+        if divisor == 0:
+            raise ZeroDivisionError
+        if abs(divisor) == 1:
+            result = dividend if 1 == divisor else -dividend
+            return min(2**31-1, max(-2**31, result))
+
+        # 确定结果的符号
+        sign = ((dividend >= 0) == (divisor >= 0))
+        
+        result = 0
+        # abs也可以直接写在while条件中，不过可能会多计算几次
+        _divisor = abs(divisor)
+        _dividend = abs(dividend)
+        
+        while _divisor <= _dividend:
+            r, _dividend = self._multi_divide(_divisor, _dividend)
+            result += r
+        
+        result = result if sign else -result
+
+        # 注意返回值不能超过32位有符号数的表示范围
+        return min(2**31-1, max(-2**31, result))
+    
+    def _multi_divide(self, divisor, dividend):
+        """
+        翻倍除法，如果可以被除，则下一步除数翻倍，直至除数大于被除数，
+        返回商加总的结果与被除数的剩余值；
+        这里就不做异常处理了；
+        :param int divisor
+        :param int dividend
+        :return tuple result, left_dividend
+        """
+        result = 0
+        times_count = 1
+        while divisor <= dividend:
+            dividend -= divisor
+            result += times_count
+            times_count += times_count
+            divisor += divisor
+        return result, dividend
+```
 
 ## 相关题目
 - [875.koko-eating-bananas](./875.koko-eating-bananas.md)