2020-07-02

Author: JiayangWu

108.将有序数组转换为二叉搜索树/108-将有序数组转换为二叉搜索树.py

@@ -0,0 +1,21 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution(object):
+    def sortedArrayToBST(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: TreeNode
+        """
+        if not nums:
+            return None
+        mid_idx = len(nums) // 2
+        root = TreeNode(nums[mid_idx])
+        root.left = self.sortedArrayToBST(nums[:mid_idx])
+        root.right = self.sortedArrayToBST(nums[mid_idx + 1:])
+        
+        return root

209.长度最小的子数组/209-长度最小的子数组.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def minSubArrayLen(self, s, nums):
+        """
+        :type s: int
+        :type nums: List[int]
+        :rtype: int
+        """
+        left = 0
+        window_sum = 0
+        res = len(nums)
+        for right in range(len(nums)):
+            window_sum += nums[right]
+            
+            while window_sum >= s:
+                res = min(res, right - left + 1)
+                window_sum -= nums[left]
+                left += 1
+        return res if sum(nums) >= s else 0

718.最长重复子数组/718-最长重复子数组.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def findLength(self, A, B):
+        """
+        :type A: List[int]
+        :type B: List[int]
+        :rtype: int
+        """
+        la, lb = len(A), len(B)
+        
+        dp = [[0 for _ in range(lb + 1)] for _ in range(la + 1)]
+        
+        res = 0
+        for i in range(1, la + 1):
+            for j in range(1, lb + 1):
+                if A[i - 1] == B[j - 1]:
+                    dp[i][j] = dp[i - 1][j - 1] + 1
+                    res = max(res, dp[i][j])
+        return res

剑指Offer50.第一个只出现一次的字符/剑指Offer50-第一个只出现一次的字符.py

@@ -5,7 +5,6 @@ def firstUniqChar(self, s):
         :rtype: str
         """
         from collections import Counter
-        
         dic = Counter(s)
 
         for ch in s:

面试题16.07.最大数值/面试题16.07-最大数值.py

@@ -5,4 +5,4 @@ def maximum(self, a, b):
         :type b: int
         :rtype: int
         """
-        return max(a, b)
+        return max(a, b)