feat: update python solutions to lc problems

Author: yanglbme

lcof2/剑指 Offer II 044. 二叉树每层的最大值/README.md

@@ -97,7 +97,7 @@ class Solution:
         ans = []
         while q:
             t = float('-inf')
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 node = q.popleft()
                 t = max(t, node.val)
                 if node.left:

lcof2/剑指 Offer II 044. 二叉树每层的最大值/Solution.py

@@ -1,23 +1,23 @@
-# Definition for a binary tree node.
-# class TreeNode:
-#     def __init__(self, val=0, left=None, right=None):
-#         self.val = val
-#         self.left = left
-#         self.right = right
-class Solution:
-    def largestValues(self, root: TreeNode) -> List[int]:
-        if root is None:
-            return []
-        q = deque([root])
-        ans = []
-        while q:
-            t = float('-inf')
-            for _ in range(len(q), 0, -1):
-                node = q.popleft()
-                t = max(t, node.val)
-                if node.left:
-                    q.append(node.left)
-                if node.right:
-                    q.append(node.right)
-            ans.append(t)
-        return ans
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def largestValues(self, root: TreeNode) -> List[int]:
+        if root is None:
+            return []
+        q = deque([root])
+        ans = []
+        while q:
+            t = float('-inf')
+            for _ in range(len(q)):
+                node = q.popleft()
+                t = max(t, node.val)
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+            ans.append(t)
+        return ans

solution/0100-0199/0127.Word Ladder/README.md

@@ -69,7 +69,7 @@ while q1 and q2:
 
 def extend(m1, m2, q):
     # 新一轮扩展
-    for _ in range(len(q), 0, -1):
+    for _ in range(len(q)):
         p = q.popleft()
         step = m1[p]
         for t in next(p):
@@ -99,7 +99,7 @@ class Solution:
         ans = 1
         while q:
             ans += 1
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 s = q.popleft()
                 s = list(s)
                 for i in range(len(s)):
@@ -123,7 +123,7 @@ class Solution:
 class Solution:
     def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int:
         def extend(m1, m2, q):
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 s = q.popleft()
                 step = m1[s]
                 s = list(s)

solution/0100-0199/0127.Word Ladder/README_EN.md

@@ -60,7 +60,7 @@ class Solution:
         ans = 1
         while q:
             ans += 1
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 s = q.popleft()
                 s = list(s)
                 for i in range(len(s)):
@@ -82,7 +82,7 @@ class Solution:
 class Solution:
     def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int:
         def extend(m1, m2, q):
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 s = q.popleft()
                 step = m1[s]
                 s = list(s)

solution/0100-0199/0127.Word Ladder/Solution.py

@@ -1,31 +1,31 @@
-class Solution:
-    def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int:
-        def extend(m1, m2, q):
-            for _ in range(len(q), 0, -1):
-                s = q.popleft()
-                step = m1[s]
-                s = list(s)
-                for i in range(len(s)):
-                    ch = s[i]
-                    for j in range(26):
-                        s[i] = chr(ord('a') + j)
-                        t = ''.join(s)
-                        if t in m1 or t not in words:
-                            continue
-                        if t in m2:
-                            return step + 1 + m2[t]
-                        m1[t] = step + 1
-                        q.append(t)
-                    s[i] = ch
-            return -1
-
-        words = set(wordList)
-        if endWord not in words:
-            return 0
-        q1, q2 = deque([beginWord]), deque([endWord])
-        m1, m2 = {beginWord: 0}, {endWord: 0}
-        while q1 and q2:
-            t = extend(m1, m2, q1) if len(q1) <= len(q2) else extend(m2, m1, q2)
-            if t != -1:
-                return t + 1
-        return 0
+class Solution:
+    def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int:
+        def extend(m1, m2, q):
+            for _ in range(len(q)):
+                s = q.popleft()
+                step = m1[s]
+                s = list(s)
+                for i in range(len(s)):
+                    ch = s[i]
+                    for j in range(26):
+                        s[i] = chr(ord('a') + j)
+                        t = ''.join(s)
+                        if t in m1 or t not in words:
+                            continue
+                        if t in m2:
+                            return step + 1 + m2[t]
+                        m1[t] = step + 1
+                        q.append(t)
+                    s[i] = ch
+            return -1
+
+        words = set(wordList)
+        if endWord not in words:
+            return 0
+        q1, q2 = deque([beginWord]), deque([endWord])
+        m1, m2 = {beginWord: 0}, {endWord: 0}
+        while q1 and q2:
+            t = extend(m1, m2, q1) if len(q1) <= len(q2) else extend(m2, m1, q2)
+            if t != -1:
+                return t + 1
+        return 0

solution/0200-0299/0286.Walls and Gates/README.md

@@ -84,7 +84,7 @@ class Solution:
         d = 0
         while q:
             d += 1
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 i, j = q.popleft()
                 for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
                     x, y = i + a, j + b

solution/0200-0299/0286.Walls and Gates/README_EN.md

@@ -60,7 +60,7 @@ class Solution:
         d = 0
         while q:
             d += 1
-            for _ in range(len(q), 0, -1):
+            for _ in range(len(q)):
                 i, j = q.popleft()
                 for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
                     x, y = i + a, j + b

solution/0200-0299/0286.Walls and Gates/Solution.py

@@ -1,18 +1,18 @@
-class Solution:
-    def wallsAndGates(self, rooms: List[List[int]]) -> None:
-        """
-        Do not return anything, modify rooms in-place instead.
-        """
-        m, n = len(rooms), len(rooms[0])
-        inf = 2**31 - 1
-        q = deque([(i, j) for i in range(m) for j in range(n) if rooms[i][j] == 0])
-        d = 0
-        while q:
-            d += 1
-            for _ in range(len(q), 0, -1):
-                i, j = q.popleft()
-                for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
-                    x, y = i + a, j + b
-                    if 0 <= x < m and 0 <= y < n and rooms[x][y] == inf:
-                        rooms[x][y] = d
-                        q.append((x, y))
+class Solution:
+    def wallsAndGates(self, rooms: List[List[int]]) -> None:
+        """
+        Do not return anything, modify rooms in-place instead.
+        """
+        m, n = len(rooms), len(rooms[0])
+        inf = 2**31 - 1
+        q = deque([(i, j) for i in range(m) for j in range(n) if rooms[i][j] == 0])
+        d = 0
+        while q:
+            d += 1
+            for _ in range(len(q)):
+                i, j = q.popleft()
+                for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
+                    x, y = i + a, j + b
+                    if 0 <= x < m and 0 <= y < n and rooms[x][y] == inf:
+                        rooms[x][y] = d
+                        q.append((x, y))

solution/0300-0399/0317.Shortest Distance from All Buildings/README.md

@@ -93,7 +93,7 @@ class Solution:
                     vis = set()
                     while q:
                         d += 1
-                        for _ in range(len(q), 0, -1):
+                        for _ in range(len(q)):
                             r, c = q.popleft()
                             for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
                                 x, y = r + a, c + b

solution/0300-0399/0317.Shortest Distance from All Buildings/README_EN.md

@@ -81,7 +81,7 @@ class Solution:
                     vis = set()
                     while q:
                         d += 1
-                        for _ in range(len(q), 0, -1):
+                        for _ in range(len(q)):
                             r, c = q.popleft()
                             for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
                                 x, y = r + a, c + b

solution/0300-0399/0317.Shortest Distance from All Buildings/Solution.py

@@ -1,36 +1,36 @@
-class Solution:
-    def shortestDistance(self, grid: List[List[int]]) -> int:
-        m, n = len(grid), len(grid[0])
-        q = deque()
-        total = 0
-        cnt = [[0] * n for _ in range(m)]
-        dist = [[0] * n for _ in range(m)]
-        for i in range(m):
-            for j in range(n):
-                if grid[i][j] == 1:
-                    total += 1
-                    q.append((i, j))
-                    d = 0
-                    vis = set()
-                    while q:
-                        d += 1
-                        for _ in range(len(q), 0, -1):
-                            r, c = q.popleft()
-                            for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
-                                x, y = r + a, c + b
-                                if (
-                                    0 <= x < m
-                                    and 0 <= y < n
-                                    and grid[x][y] == 0
-                                    and (x, y) not in vis
-                                ):
-                                    cnt[x][y] += 1
-                                    dist[x][y] += d
-                                    q.append((x, y))
-                                    vis.add((x, y))
-        ans = float('inf')
-        for i in range(m):
-            for j in range(n):
-                if grid[i][j] == 0 and cnt[i][j] == total:
-                    ans = min(ans, dist[i][j])
-        return -1 if ans == float('inf') else ans
+class Solution:
+    def shortestDistance(self, grid: List[List[int]]) -> int:
+        m, n = len(grid), len(grid[0])
+        q = deque()
+        total = 0
+        cnt = [[0] * n for _ in range(m)]
+        dist = [[0] * n for _ in range(m)]
+        for i in range(m):
+            for j in range(n):
+                if grid[i][j] == 1:
+                    total += 1
+                    q.append((i, j))
+                    d = 0
+                    vis = set()
+                    while q:
+                        d += 1
+                        for _ in range(len(q)):
+                            r, c = q.popleft()
+                            for a, b in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
+                                x, y = r + a, c + b
+                                if (
+                                    0 <= x < m
+                                    and 0 <= y < n
+                                    and grid[x][y] == 0
+                                    and (x, y) not in vis
+                                ):
+                                    cnt[x][y] += 1
+                                    dist[x][y] += d
+                                    q.append((x, y))
+                                    vis.add((x, y))
+        ans = float('inf')
+        for i in range(m):
+            for j in range(n):
+                if grid[i][j] == 0 and cnt[i][j] == total:
+                    ans = min(ans, dist[i][j])
+        return -1 if ans == float('inf') else ans

solution/0400-0499/0417.Pacific Atlantic Water Flow/README.md

@@ -60,7 +60,7 @@ class Solution:
     def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:
         def bfs(q, vis):
             while q:
-                for _ in range(len(q), 0, -1):
+                for _ in range(len(q)):
                     i, j = q.popleft()
                     for a, b in [[0, -1], [0, 1], [1, 0], [-1, 0]]:
                         x, y = i + a, j + b

solution/0400-0499/0417.Pacific Atlantic Water Flow/README_EN.md

@@ -48,7 +48,7 @@ class Solution:
     def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:
         def bfs(q, vis):
             while q:
-                for _ in range(len(q), 0, -1):
+                for _ in range(len(q)):
                     i, j = q.popleft()
                     for a, b in [[0, -1], [0, 1], [1, 0], [-1, 0]]:
                         x, y = i + a, j + b