feat: update solutions to lc problems

yanglbme · yanglbme · commit 29ae471ae9f9 · 2022-05-12T10:33:08.000+08:00
diff --git a/lcci/04.01.Route Between Nodes/Solution.py b/lcci/04.01.Route Between Nodes/Solution.py
@@ -1,5 +1,7 @@
 class Solution:
-    def findWhetherExistsPath(self, n: int, graph: List[List[int]], start: int, target: int) -> bool:
+    def findWhetherExistsPath(
+        self, n: int, graph: List[List[int]], start: int, target: int
+    ) -> bool:
         g = defaultdict(list)
         for u, v in graph:
             g[u].append(v)
diff --git a/lcof2/剑指 Offer II 107. 矩阵中的距离/README.md b/lcof2/剑指 Offer II 107. 矩阵中的距离/README.md
@@ -49,7 +49,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-多源 BFS。
+**方法一：多源 BFS**
 
 初始化结果矩阵 ans，所有 0 的距离为 0，所以 1 的距离为 -1。初始化队列 q 存储 BFS 需要检查的位置，并将所有 0 的位置入队。
 
@@ -67,9 +67,9 @@ class Solution:
         m, n = len(mat), len(mat[0])
         ans = [[-1] * n for _ in range(m)]
         q = deque()
-        for i in range(m):
-            for j in range(n):
-                if mat[i][j] == 0:
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                if v == 0:
                     ans[i][j] = 0
                     q.append((i, j))
         dirs = [(0, 1), (0, -1), (1, 0), (-1, 0)]
@@ -178,9 +178,9 @@ func updateMatrix(mat [][]int) [][]int {
 	}
 	type pair struct{ x, y int }
 	var q []pair
-	for i := 0; i < m; i++ {
-		for j := 0; j < n; j++ {
-			if mat[i][j] == 0 {
+	for i, row := range mat {
+		for j, v := range row {
+			if v == 0 {
 				ans[i][j] = 0
 				q = append(q, pair{i, j})
 			}
diff --git a/lcof2/剑指 Offer II 107. 矩阵中的距离/Solution.go b/lcof2/剑指 Offer II 107. 矩阵中的距离/Solution.go
@@ -9,9 +9,9 @@ func updateMatrix(mat [][]int) [][]int {
 	}
 	type pair struct{ x, y int }
 	var q []pair
-	for i := 0; i < m; i++ {
-		for j := 0; j < n; j++ {
-			if mat[i][j] == 0 {
+	for i, row := range mat {
+		for j, v := range row {
+			if v == 0 {
 				ans[i][j] = 0
 				q = append(q, pair{i, j})
 			}
diff --git a/lcof2/剑指 Offer II 107. 矩阵中的距离/Solution.py b/lcof2/剑指 Offer II 107. 矩阵中的距离/Solution.py
@@ -3,9 +3,9 @@ def updateMatrix(self, mat: List[List[int]]) -> List[List[int]]:
         m, n = len(mat), len(mat[0])
         ans = [[-1] * n for _ in range(m)]
         q = deque()
-        for i in range(m):
-            for j in range(n):
-                if mat[i][j] == 0:
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                if v == 0:
                     ans[i][j] = 0
                     q.append((i, j))
         dirs = [(0, 1), (0, -1), (1, 0), (-1, 0)]
diff --git a/solution/0500-0599/0542.01 Matrix/README.md b/solution/0500-0599/0542.01 Matrix/README.md
@@ -47,7 +47,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-多源 BFS。
+**方法一：多源 BFS**
 
 初始化结果矩阵 ans，所有 0 的距离为 0，所以 1 的距离为 -1。初始化队列 q 存储 BFS 需要检查的位置，并将所有 0 的位置入队。
 
@@ -65,9 +65,9 @@ class Solution:
         m, n = len(mat), len(mat[0])
         ans = [[-1] * n for _ in range(m)]
         q = deque()
-        for i in range(m):
-            for j in range(n):
-                if mat[i][j] == 0:
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                if v == 0:
                     ans[i][j] = 0
                     q.append((i, j))
         dirs = [(0, 1), (0, -1), (1, 0), (-1, 0)]
@@ -176,9 +176,9 @@ func updateMatrix(mat [][]int) [][]int {
 	}
 	type pair struct{ x, y int }
 	var q []pair
-	for i := 0; i < m; i++ {
-		for j := 0; j < n; j++ {
-			if mat[i][j] == 0 {
+	for i, row := range mat {
+		for j, v := range row {
+			if v == 0 {
 				ans[i][j] = 0
 				q = append(q, pair{i, j})
 			}
diff --git a/solution/0500-0599/0542.01 Matrix/README_EN.md b/solution/0500-0599/0542.01 Matrix/README_EN.md
@@ -47,9 +47,9 @@ class Solution:
         m, n = len(mat), len(mat[0])
         ans = [[-1] * n for _ in range(m)]
         q = deque()
-        for i in range(m):
-            for j in range(n):
-                if mat[i][j] == 0:
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                if v == 0:
                     ans[i][j] = 0
                     q.append((i, j))
         dirs = [(0, 1), (0, -1), (1, 0), (-1, 0)]
@@ -156,9 +156,9 @@ func updateMatrix(mat [][]int) [][]int {
 	}
 	type pair struct{ x, y int }
 	var q []pair
-	for i := 0; i < m; i++ {
-		for j := 0; j < n; j++ {
-			if mat[i][j] == 0 {
+	for i, row := range mat {
+		for j, v := range row {
+			if v == 0 {
 				ans[i][j] = 0
 				q = append(q, pair{i, j})
 			}
diff --git a/solution/0500-0599/0542.01 Matrix/Solution.go b/solution/0500-0599/0542.01 Matrix/Solution.go
@@ -9,9 +9,9 @@ func updateMatrix(mat [][]int) [][]int {
 	}
 	type pair struct{ x, y int }
 	var q []pair
-	for i := 0; i < m; i++ {
-		for j := 0; j < n; j++ {
-			if mat[i][j] == 0 {
+	for i, row := range mat {
+		for j, v := range row {
+			if v == 0 {
 				ans[i][j] = 0
 				q = append(q, pair{i, j})
 			}
diff --git a/solution/0800-0899/0854.K-Similar Strings/Solution.py b/solution/0800-0899/0854.K-Similar Strings/Solution.py
@@ -7,7 +7,7 @@ def next(s):
                 i += 1
             for j in range(i + 1, n):
                 if s[j] == s2[i] and s[j] != s2[j]:
-                    res.append(s[:i] + s[j] + s[i + 1: j] + s[i] + s[j + 1:])
+                    res.append(s[:i] + s[j] + s[i + 1 : j] + s[i] + s[j + 1 :])
             return res
 
         q = deque([s1])
diff --git a/solution/0800-0899/0864.Shortest Path to Get All Keys/Solution.py b/solution/0800-0899/0864.Shortest Path to Get All Keys/Solution.py
@@ -21,7 +21,10 @@ def shortestPathAllKeys(self, grid: List[str]) -> int:
                     nxt = state
                     x, y = i + dirs[k], j + dirs[k + 1]
                     if 0 <= x < m and 0 <= y < n and grid[x][y] != '#':
-                        if grid[x][y].isupper() and (nxt & (1 << (ord(grid[x][y]) - ord('A')))) == 0:
+                        if (
+                            grid[x][y].isupper()
+                            and (nxt & (1 << (ord(grid[x][y]) - ord('A')))) == 0
+                        ):
                             continue
                         if grid[x][y].islower():
                             nxt |= 1 << (ord(grid[x][y]) - ord('a'))
diff --git a/solution/1200-1299/1210.Minimum Moves to Reach Target with Rotations/Solution.py b/solution/1200-1299/1210.Minimum Moves to Reach Target with Rotations/Solution.py
@@ -17,11 +17,21 @@ def check(a, b):
                     return ans
                 i1, j1 = a // n, a % n
                 i2, j2 = b // n, b % n
-                if j1 + 1 < n and j2 + 1 < n and grid[i1][j1 + 1] == 0 and grid[i2][j2 + 1] == 0:
+                if (
+                    j1 + 1 < n
+                    and j2 + 1 < n
+                    and grid[i1][j1 + 1] == 0
+                    and grid[i2][j2 + 1] == 0
+                ):
                     check(i1 * n + j1 + 1, i2 * n + j2 + 1)
                     if j1 == j2:
                         check(a, i1 * n + j2 + 1)
-                if i1 + 1 < n and i2 + 1 < n and grid[i1 + 1][j1] == 0 and grid[i2 + 1][j2] == 0:
+                if (
+                    i1 + 1 < n
+                    and i2 + 1 < n
+                    and grid[i1 + 1][j1] == 0
+                    and grid[i2 + 1][j2] == 0
+                ):
                     check((i1 + 1) * n + j1, (i2 + 1) * n + j2)
                     if i1 == i2:
                         check(a, (i2 + 1) * n + j1)
diff --git a/solution/1200-1299/1284.Minimum Number of Flips to Convert Binary Matrix to Zero Matrix/Solution.py b/solution/1200-1299/1284.Minimum Number of Flips to Convert Binary Matrix to Zero Matrix/Solution.py
@@ -1,8 +1,7 @@
 class Solution:
     def minFlips(self, mat: List[List[int]]) -> int:
         m, n = len(mat), len(mat[0])
-        state = sum(1 << (i * n + j) for i in range(m)
-                    for j in range(n) if mat[i][j])
+        state = sum(1 << (i * n + j) for i in range(m) for j in range(n) if mat[i][j])
         q = deque([state])
         vis = set([state])
         ans = 0
diff --git a/solution/1300-1399/1381.Design a Stack With Increment Operation/Solution.py b/solution/1300-1399/1381.Design a Stack With Increment Operation/Solution.py
@@ -1,5 +1,4 @@
 class CustomStack:
-
     def __init__(self, maxSize: int):
         self.s = [0] * maxSize
         self.t = 0
diff --git a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/Solution.py b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/Solution.py
@@ -13,6 +13,7 @@
 #
 #
 
+
 class Solution(object):
     def findShortestPath(self, master: 'GridMaster') -> int:
         def dfs(i, j):
@@ -29,8 +30,12 @@ def dfs(i, j):
 
         target = None
         s = set()
-        dirs = [['U', 'D', -1, 0], ['D', 'U', 1, 0],
-                ['L', 'R', 0, -1], ['R', 'L', 0, 1]]
+        dirs = [
+            ['U', 'D', -1, 0],
+            ['D', 'U', 1, 0],
+            ['L', 'R', 0, -1],
+            ['R', 'L', 0, 1],
+        ]
         dfs(0, 0)
         if target is None:
             return -1
diff --git a/solution/1900-1999/1993.Operations on Tree/Solution.py b/solution/1900-1999/1993.Operations on Tree/Solution.py
@@ -1,5 +1,4 @@
 class LockingTree:
-
     def __init__(self, parent: List[int]):
         self.nums = {}
         self.parent = parent
diff --git a/solution/2000-2099/2092.Find All People With Secret/Solution.py b/solution/2000-2099/2092.Find All People With Secret/Solution.py
@@ -1,5 +1,7 @@
 class Solution:
-    def findAllPeople(self, n: int, meetings: List[List[int]], firstPerson: int) -> List[int]:
+    def findAllPeople(
+        self, n: int, meetings: List[List[int]], firstPerson: int
+    ) -> List[int]:
         vis = [False] * n
         vis[0] = vis[firstPerson] = True
         meetings.sort(key=lambda x: x[2])
@@ -10,7 +12,7 @@ def findAllPeople(self, n: int, meetings: List[List[int]], firstPerson: int) ->
                 j += 1
             s = set()
             g = defaultdict(list)
-            for x, y, _ in meetings[i: j + 1]:
+            for x, y, _ in meetings[i : j + 1]:
                 g[x].append(y)
                 g[y].append(x)
                 s.update([x, y])
diff --git a/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/Solution.py b/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/Solution.py
@@ -1,8 +1,7 @@
 class Solution:
     def removeOnes(self, grid: List[List[int]]) -> int:
         m, n = len(grid), len(grid[0])
-        state = sum(1 << (i * n + j) for i in range(m)
-                    for j in range(n) if grid[i][j])
+        state = sum(1 << (i * n + j) for i in range(m) for j in range(n) if grid[i][j])
         q = deque([state])
         vis = set([state])
         ans = 0

Original file line number	Diff line number	Diff line change
`@@ -9,9 +9,9 @@ func updateMatrix(mat [][]int) [][]int {`
`9`	`9`	`}`
`10`	`10`	`type pair struct{ x, y int }`
`11`	`11`	`var q []pair`
`12`		`- for i := 0; i < m; i++ {`
`13`		`- for j := 0; j < n; j++ {`
`14`		`- if mat[i][j] == 0 {`
	`12`	`+ for i, row := range mat {`
	`13`	`+ for j, v := range row {`
	`14`	`+ if v == 0 {`
`15`	`15`	`ans[i][j] = 0`
`16`	`16`	`q = append(q, pair{i, j})`
`17`	`17`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,4 @@`
`1`	`1`	`class CustomStack:`
`2`		`-`
`3`	`2`	`def __init__(self, maxSize: int):`
`4`	`3`	`self.s = [0] * maxSize`
`5`	`4`	`self.t = 0`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,4 @@`
`1`	`1`	`class LockingTree:`
`2`		`-`
`3`	`2`	`def __init__(self, parent: List[int]):`
`4`	`3`	`self.nums = {}`
`5`	`4`	`self.parent = parent`