fix page build failed

EslSuwen · EslSuwen · commit d9acdb33c93f · 2020-07-20T14:08:54.000+08:00
diff --git a/docs/algorithms/剑指offer.md b/docs/algorithms/剑指offer.md
@@ -1620,55 +1620,6 @@ public static int LastRemaining_Solution(int n, int m) {
 
 解析：回溯法也就是特殊的dfs，需要找到所有的路径，所以每当到达边界条件或抵达目标时，递归返回，由于需要保存路径中的字母，所以递归返回时需要删除路径最后的节点，来保证路径合法。不过本题只有一个解，所以找到即可返回。
 
-    public class 矩阵中的路径 {
-        public static void main(String[] args) {
-            char[][]arr = {{'a','b','c','e'},{'s','f','c','s'},{'a','d','e','e'}};
-            char []str = {'b','c','c','e','d'};
-            System.out.println(hasPath(arr, arr.length, arr[0].length, str));
-        }
-        static int flag = 0;
-        public static boolean hasPath(char[][] matrix, int rows, int cols, char[] str)
-        {
-            int [][]visit = new int[rows][cols];
-            StringBuilder sb = new StringBuilder();
-            for (int i = 0;i < rows;i ++) {
-                for (int j = 0;j < cols;j ++) {
-                    if (matrix[i][j] == str[0]) {
-                        visit[i][j] = 1;
-                        sb.append(str[0]);
-                        dfs(matrix, i, j, visit, str, 1, sb);
-                        visit[i][j] = 0;
-                        sb.deleteCharAt(sb.length() - 1);
-                    }
-                }
-            }
-            return flag == 1;
-        }
-        public static void dfs(char [][]matrix, int row, int col, int [][]visit, char []str, int cur, StringBuilder sb) {
-            if (sb.length() == str.length) {
-    //            System.out.println(sb.toString());
-                flag = 1;
-                return;
-            }
-    
-            int [][]pos = {{1,0},{-1,0},{0,1},{0,-1}};
-            for (int i = 0;i < pos.length;i ++) {
-                int x = row + pos[i][0];
-                int y = col + pos[i][1];
-                if (x >= matrix.length || x < 0 || y >= matrix[0].length || y < 0) {
-                    continue;
-                }
-                if (visit[x][y] == 0 && matrix[x][y] == str[cur]) {
-                    sb.append(matrix[x][y]);
-                    visit[x][y] = 1;
-                    dfs(matrix, x, y, visit, str, cur + 1, sb);
-                    sb.deleteCharAt(sb.length() - 1);
-                    visit[x][y] = 0;
-                }
-            }
-        }
-
-
 ​    
 ## 机器人的运动范围
 
