feat: using cache instead of lru_cache in python solutions

cache and lru_cache(maxsize=None) are exactly the same (linkto cpython source).
If we don't want to limit the cache size, using cache may make the code clearer, since a least recently used cache without limit doesn't make much sense.

Author: yanglbme

lcof/面试题43. 1～n整数中1出现的次数/README.md

@@ -59,10 +59,8 @@ high=3,lows=356,base=1000。此时 n 可拆分为 `0~999`,`1000~1999`,`2000~2999
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-from functools import lru_cache
-
 class Solution:
-    @lru_cache
+    @cache
     def countDigitOne(self, n: int) -> int:
         if n < 1:
             return 0

lcof/面试题43. 1～n整数中1出现的次数/Solution.py

@@ -1,8 +1,5 @@
-from functools import lru_cache
-
-
 class Solution:
-    @lru_cache
+    @cache
     def countDigitOne(self, n: int) -> int:
         if n < 1:
             return 0

lcof2/剑指 Offer II 096. 字符串交织/README.md

@@ -75,7 +75,7 @@ class Solution:
         if m + n != len(s3):
             return False
 
-        @lru_cache
+        @cache
         def dfs(i, j):
             if i == m and j == n:
                 return True

lcof2/剑指 Offer II 096. 字符串交织/Solution.py

@@ -4,7 +4,7 @@ def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
         if m + n != len(s3):
             return False
 
-        @lru_cache
+        @cache
         def dfs(i, j):
             if i == m and j == n:
                 return True

lcof2/剑指 Offer II 101. 分割等和子串/README.md

@@ -105,7 +105,7 @@ class Solution:
             return False
         target = s >> 1
 
-        @lru_cache(None)
+        @cache
         def dfs(i, s):
             nonlocal target
             if s > target or i >= len(nums):

lcof2/剑指 Offer II 102. 加减的目标值/README.md

@@ -125,7 +125,7 @@ class Solution:
 ```python
 class Solution:
     def findTargetSumWays(self, nums: List[int], target: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, t):
             if i == n:
                 if t == target:

lcof2/剑指 Offer II 112. 最长递增路径/README.md

@@ -66,7 +66,7 @@
 ```python
 class Solution:
     def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j):
             ans = 1
             for a, b in [[-1, 0], [1, 0], [0, 1], [0, -1]]:

lcof2/剑指 Offer II 112. 最长递增路径/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j):
             ans = 1
             for a, b in [[-1, 0], [1, 0], [0, 1], [0, -1]]:

solution/0000-0099/0097.Interleaving String/README.md

@@ -75,7 +75,7 @@ class Solution:
         if m + n != len(s3):
             return False
 
-        @lru_cache
+        @cache
         def dfs(i, j):
             if i == m and j == n:
                 return True

solution/0000-0099/0097.Interleaving String/README_EN.md

@@ -64,7 +64,7 @@ class Solution:
         if m + n != len(s3):
             return False
 
-        @lru_cache
+        @cache
         def dfs(i, j):
             if i == m and j == n:
                 return True

solution/0000-0099/0097.Interleaving String/Solution.py

@@ -4,7 +4,7 @@ def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
         if m + n != len(s3):
             return False
 
-        @lru_cache
+        @cache
         def dfs(i, j):
             if i == m and j == n:
                 return True

solution/0300-0399/0329.Longest Increasing Path in a Matrix/README.md

@@ -60,7 +60,7 @@
 ```python
 class Solution:
     def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j):
             ans = 1
             for a, b in [[-1, 0], [1, 0], [0, 1], [0, -1]]:

solution/0300-0399/0329.Longest Increasing Path in a Matrix/README_EN.md

@@ -51,7 +51,7 @@
 ```python
 class Solution:
     def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j):
             ans = 1
             for a, b in [[-1, 0], [1, 0], [0, 1], [0, -1]]:

solution/0300-0399/0329.Longest Increasing Path in a Matrix/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def longestIncreasingPath(self, matrix: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j):
             ans = 1
             for a, b in [[-1, 0], [1, 0], [0, 1], [0, -1]]:

solution/0300-0399/0337.House Robber III/README.md

@@ -65,7 +65,7 @@
 #         self.right = right
 class Solution:
     def rob(self, root: TreeNode) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(root):
             if root is None:
                 return 0

solution/0300-0399/0337.House Robber III/README_EN.md

@@ -50,7 +50,7 @@
 #         self.right = right
 class Solution:
     def rob(self, root: TreeNode) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(root):
             if root is None:
                 return 0

solution/0300-0399/0337.House Robber III/Solution.py

@@ -6,7 +6,7 @@
 #         self.right = right
 class Solution:
     def rob(self, root: TreeNode) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(root):
             if root is None:
                 return 0

solution/0400-0499/0416.Partition Equal Subset Sum/README.md

@@ -98,7 +98,7 @@ class Solution:
             return False
         target = s >> 1
 
-        @lru_cache(None)
+        @cache
         def dfs(i, s):
             nonlocal target
             if s > target or i >= len(nums):

solution/0400-0499/0416.Partition Equal Subset Sum/README_EN.md

@@ -79,7 +79,7 @@ class Solution:
             return False
         target = s >> 1
 
-        @lru_cache(None)
+        @cache
         def dfs(i, s):
             nonlocal target
             if s > target or i >= len(nums):

solution/0400-0499/0464.Can I Win/README.md

@@ -67,7 +67,7 @@
 ```python
 class Solution:
     def canIWin(self, maxChoosableInteger: int, desiredTotal: int) -> bool:
-        @lru_cache(None)
+        @cache
         def dfs(state, t):
             for i in range(1, maxChoosableInteger + 1):
                 if (state >> i) & 1:

solution/0400-0499/0464.Can I Win/README_EN.md

@@ -57,7 +57,7 @@ Same with other integers chosen by the first player, the second player will alwa
 ```python
 class Solution:
     def canIWin(self, maxChoosableInteger: int, desiredTotal: int) -> bool:
-        @lru_cache(None)
+        @cache
         def dfs(state, t):
             for i in range(1, maxChoosableInteger + 1):
                 if (state >> i) & 1:

solution/0400-0499/0464.Can I Win/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def canIWin(self, maxChoosableInteger: int, desiredTotal: int) -> bool:
-        @lru_cache(None)
+        @cache
         def dfs(state, t):
             for i in range(1, maxChoosableInteger + 1):
                 if (state >> i) & 1:

solution/0400-0499/0494.Target Sum/README.md

@@ -106,7 +106,7 @@ DFS：
 ```python
 class Solution:
     def findTargetSumWays(self, nums: List[int], target: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, t):
             if i == n:
                 if t == target:

solution/0400-0499/0494.Target Sum/README_EN.md

@@ -92,7 +92,7 @@ DFS:
 ```python
 class Solution:
     def findTargetSumWays(self, nums: List[int], target: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, t):
             if i == n:
                 if t == target:

solution/0700-0799/0787.Cheapest Flights Within K Stops/README.md

@@ -82,12 +82,9 @@ class Solution:
 ```
 
 ```python
-from functools import lru_cache
-
-
 class Solution:
     def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, k: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(u, k):
             if u == dst:
                 return 0

solution/0700-0799/0787.Cheapest Flights Within K Stops/README_EN.md

@@ -75,12 +75,9 @@ class Solution:
 ```
 
 ```python
-from functools import lru_cache
-
-
 class Solution:
     def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, k: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(u, k):
             if u == dst:
                 return 0

solution/0900-0999/0913.Cat and Mouse/README.md

@@ -73,7 +73,7 @@
 ```python
 class Solution:
     def catMouseGame(self, graph: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j, k):
             # 老鼠 / 猫 / 总步数
             if k >= 2 * len(graph):

solution/0900-0999/0913.Cat and Mouse/README_EN.md

@@ -66,7 +66,7 @@
 ```python
 class Solution:
     def catMouseGame(self, graph: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j, k):
             # mouse / cat / steps
             if k >= 2 * len(graph):

solution/0900-0999/0913.Cat and Mouse/Solutioin.py

@@ -1,6 +1,6 @@
 class Solution:
     def catMouseGame(self, graph: List[List[int]]) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i, j, k):
             # mouse / cat / steps
             if k >= 2 * len(graph):

solution/1400-1499/1462.Course Schedule IV/README.md

@@ -80,7 +80,7 @@ DFS 记忆化搜索。
 ```python
 class Solution:
     def checkIfPrerequisite(self, numCourses: int, prerequisites: List[List[int]], queries: List[List[int]]) -> List[bool]:
-        @lru_cache(None)
+        @cache
         def dfs(a, b):
             if b in g[a] or a == b:
                 return True

solution/1400-1499/1462.Course Schedule IV/README_EN.md

@@ -68,7 +68,7 @@ DFS.
 ```python
 class Solution:
     def checkIfPrerequisite(self, numCourses: int, prerequisites: List[List[int]], queries: List[List[int]]) -> List[bool]:
-        @lru_cache(None)
+        @cache
         def dfs(a, b):
             if b in g[a] or a == b:
                 return True

solution/1400-1499/1462.Course Schedule IV/Solution.py

@@ -2,7 +2,7 @@ class Solution:
     def checkIfPrerequisite(
         self, numCourses: int, prerequisites: List[List[int]], queries: List[List[int]]
     ) -> List[bool]:
-        @lru_cache(None)
+        @cache
         def dfs(a, b):
             if b in g[a] or a == b:
                 return True

solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README.md

@@ -84,7 +84,7 @@
 ```python
 class Solution:
     def minimumCost(self, sentence: str, k: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i):
             if s[-1] - s[i] + n - i - 1 <= k:
                 return 0

solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README_EN.md

@@ -75,7 +75,7 @@ The cost of the last row is not included in the total cost, and since there is o
 ```python
 class Solution:
     def minimumCost(self, sentence: str, k: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i):
             if s[-1] - s[i] + n - i - 1 <= k:
                 return 0

solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def minimumCost(self, sentence: str, k: int) -> int:
-        @lru_cache(None)
+        @cache
         def dfs(i):
             if s[-1] - s[i] + n - i - 1 <= k:
                 return 0

solution/2200-2299/2267.Check if There Is a Valid Parentheses String Path/README.md

@@ -76,7 +76,7 @@
 ```python
 class Solution:
     def hasValidPath(self, grid: List[List[str]]) -> bool:
-        @lru_cache(None)
+        @cache
         def dfs(i, j, t):
             if grid[i][j] == '(':
                 t += 1

solution/2200-2299/2267.Check if There Is a Valid Parentheses String Path/README_EN.md

@@ -62,7 +62,7 @@ Note that there may be other valid parentheses string paths.
 ```python
 class Solution:
     def hasValidPath(self, grid: List[List[str]]) -> bool:
-        @lru_cache(None)
+        @cache
         def dfs(i, j, t):
             if grid[i][j] == '(':
                 t += 1

solution/2200-2299/2267.Check if There Is a Valid Parentheses String Path/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def hasValidPath(self, grid: List[List[str]]) -> bool:
-        @lru_cache(None)
+        @cache
         def dfs(i, j, t):
             if grid[i][j] == '(':
                 t += 1