fix: update

Author: yanglbme

solution/2800-2899/2844.Minimum Operations to Make a Special Number/README.md

@@ -144,18 +144,18 @@ public:
         int n = num.size();
         int f[n][25];
         memset(f, -1, sizeof(f));
-        function<int(int, int)> dfs = [&](int i, int k) -> int {
+        auto dfs = [&](auto&& dfs, int i, int k) -> int {
             if (i == n) {
                 return k == 0 ? 0 : n;
             }
             if (f[i][k] != -1) {
                 return f[i][k];
             }
-            f[i][k] = dfs(i + 1, k) + 1;
-            f[i][k] = min(f[i][k], dfs(i + 1, (k * 10 + num[i] - '0') % 25));
+            f[i][k] = dfs(dfs, i + 1, k) + 1;
+            f[i][k] = min(f[i][k], dfs(dfs, i + 1, (k * 10 + num[i] - '0') % 25));
             return f[i][k];
         };
-        return dfs(0, 0);
+        return dfs(dfs, 0, 0);
     }
 };
 ```

solution/2800-2899/2844.Minimum Operations to Make a Special Number/README_EN.md

@@ -141,18 +141,18 @@ public:
         int n = num.size();
         int f[n][25];
         memset(f, -1, sizeof(f));
-        function<int(int, int)> dfs = [&](int i, int k) -> int {
+        auto dfs = [&](auto&& dfs, int i, int k) -> int {
             if (i == n) {
                 return k == 0 ? 0 : n;
             }
             if (f[i][k] != -1) {
                 return f[i][k];
             }
-            f[i][k] = dfs(i + 1, k) + 1;
-            f[i][k] = min(f[i][k], dfs(i + 1, (k * 10 + num[i] - '0') % 25));
+            f[i][k] = dfs(dfs, i + 1, k) + 1;
+            f[i][k] = min(f[i][k], dfs(dfs, i + 1, (k * 10 + num[i] - '0') % 25));
             return f[i][k];
         };
-        return dfs(0, 0);
+        return dfs(dfs, 0, 0);
     }
 };
 ```

solution/2800-2899/2844.Minimum Operations to Make a Special Number/Solution.cpp

@@ -4,17 +4,17 @@ class Solution {
         int n = num.size();
         int f[n][25];
         memset(f, -1, sizeof(f));
-        function<int(int, int)> dfs = [&](int i, int k) -> int {
+        auto dfs = [&](auto&& dfs, int i, int k) -> int {
             if (i == n) {
                 return k == 0 ? 0 : n;
             }
             if (f[i][k] != -1) {
                 return f[i][k];
             }
-            f[i][k] = dfs(i + 1, k) + 1;
-            f[i][k] = min(f[i][k], dfs(i + 1, (k * 10 + num[i] - '0') % 25));
+            f[i][k] = dfs(dfs, i + 1, k) + 1;
+            f[i][k] = min(f[i][k], dfs(dfs, i + 1, (k * 10 + num[i] - '0') % 25));
             return f[i][k];
         };
-        return dfs(0, 0);
+        return dfs(dfs, 0, 0);
     }
 };