add 29

Author: luliyucoordinate

README.md

@@ -31,6 +31,8 @@ LeetCode
 |0026|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | c | [c++](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.cpp) |[python](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.py)|||Easy|
 |0027|[Remove Element](https://leetcode.com/problems/remove-element/) | c | [c++](./src/0027-Remove-Element/0027.cpp) |[python](./src/0027-Remove-Element/0027.py)|||Easy|
 |0028|[Implement strStr()](https://leetcode.com/problems/implement-strstr/) | c | [c++](./src/0028-Implement-strStr()/0028.cpp) |[python](./src/0028-Implement-strStr()/0028.py)|||Easy|
+|0029|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | c | [c++](./src/0029-Divide-Two-Integers/0029.cpp) |[python](./src/0029-Divide-Two-Integers/0029.py)|||Medium|
+|0030|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | c | [c++](./src/0030-Substring-with-Concatenation-of-All-Words/0030.cpp) |[python](./src/0030-Substring-with-Concatenation-of-All-Words/0030.py)|||Hard|
 |0031|[Next Permutation](https://leetcode.com/problems/next-permutation/) | c | [c++](./src/0031-Next-Permutation/0031.cpp) |[python](./src/0031-Next-Permutation/0031.py)|||Medium|
 |0032|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | c | [c++](./src/0032-Longest-Valid-Parentheses/0032.cpp) |[python](./src/0032-Longest-Valid-Parentheses/0032.py)|||Hard|
 |0033|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | c | [c++](./src/0033-Search-in-Rotated-Sorted-Array/0033.cpp) |[python](./src/0033-Search-in-Rotated-Sorted-Array/0033.py)|||Medium|

src/0029-Divide-Two-Integers/0029.cpp

@@ -0,0 +1,28 @@
+#include <cstdlib>
+using namespace std;
+
+static int x = [](){std::ios::sync_with_stdio(false);cin.tie(0);return 0;}();
+class Solution 
+{
+public:
+    int divide(int dividend, int divisor) 
+    {
+        long long res = 0;
+        long long divd = labs(dividend), divs = labs(divisor);
+        int pos = (dividend < 0) ^ (divisor < 0);
+        long long mod = (long long)INT_MAX + 1;
+        if (divd < divs) return 0;
+        while (divs <= divd)
+        {
+            long long mul = 1, tmp = divs;
+            while ((tmp << 1) <= divd)
+            {
+                mul <<= 1; tmp <<= 1;
+            }
+            res += mul; divd -= tmp;
+            if (res == mod) break;
+        }
+        if (pos == 0 and res == mod) res -= 1;
+        return pos == 0 ? res : -res;
+    }
+};

src/0029-Divide-Two-Integers/0029.py

@@ -0,0 +1,31 @@
+class Solution:
+    def divide(self, dividend, divisor):
+        """
+        :type dividend: int
+        :type divisor: int
+        :rtype: int
+        """
+        pos = False if (dividend < 0) ^ (divisor < 0) else True
+            
+        res, divd, divs = 0, abs(dividend), abs(divisor)
+            
+        if divd < divs:
+            return 0
+        
+        mod = 2**31
+        while divs <= divd:
+            mul, tmp = 1, divs
+            while (tmp << 1) <= divd:
+                mul <<= 1
+                tmp <<= 1
+            
+            res += mul
+            divd -= tmp
+            
+            if res == mod:
+                break
+                
+        if pos and res == mod:
+            res -= 1
+              
+        return res if pos else -res