feat: update solutions to lc problems: No.3661,3418 (#5129)

Author: yanglbme

solution/3400-3499/3418.Maximum Amount of Money Robot Can Earn/README.md

@@ -124,7 +124,9 @@ class Solution:
             return ans
 
         m, n = len(coins), len(coins[0])
-        return dfs(0, 0, 2)
+        ans = dfs(0, 0, 2)
+        dfs.cache_clear()
+        return ans
 ```
 
 #### Java

solution/3400-3499/3418.Maximum Amount of Money Robot Can Earn/README_EN.md

@@ -122,7 +122,9 @@ class Solution:
             return ans
 
         m, n = len(coins), len(coins[0])
-        return dfs(0, 0, 2)
+        ans = dfs(0, 0, 2)
+        dfs.cache_clear()
+        return ans
 ```
 
 #### Java

solution/3400-3499/3418.Maximum Amount of Money Robot Can Earn/Solution.py

@@ -12,4 +12,6 @@ def dfs(i: int, j: int, k: int) -> int:
             return ans
 
         m, n = len(coins), len(coins[0])
-        return dfs(0, 0, 2)
+        ans = dfs(0, 0, 2)
+        dfs.cache_clear()
+        return ans

solution/3600-3699/3661.Maximum Walls Destroyed by Robots/README.md

@@ -158,7 +158,9 @@ class Solution:
             ans = max(ans, dfs(i - 1, 1) + r - l)
             return ans
 
-        return dfs(n - 1, 1)
+        ans = dfs(n - 1, 1)
+        dfs.cache_clear()
+        return ans
 ```
 
 #### Java

solution/3600-3699/3661.Maximum Walls Destroyed by Robots/README_EN.md

@@ -157,7 +157,9 @@ class Solution:
             ans = max(ans, dfs(i - 1, 1) + r - l)
             return ans
 
-        return dfs(n - 1, 1)
+        ans = dfs(n - 1, 1)
+        dfs.cache_clear()
+        return ans
 ```
 
 #### Java

solution/3600-3699/3661.Maximum Walls Destroyed by Robots/Solution.py

@@ -25,4 +25,6 @@ def dfs(i: int, j: int) -> int:
             ans = max(ans, dfs(i - 1, 1) + r - l)
             return ans
 
-        return dfs(n - 1, 1)
+        ans = dfs(n - 1, 1)
+        dfs.cache_clear()
+        return ans