Java -根据数组键对查找所有可能的路径

import java.util.ArrayList;
import java.util.List;

public class ArrayPathFinder {
    public List<String> findPaths(char[][] array, String key) {
        List<String> paths = new ArrayList<>();
        boolean[][] visited = new boolean[array.length][array[0].length];
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[0].length; j++) {
                dfs(array, key, i, j, 0, "", visited, paths);
            }
        }
        return paths;
    }

    private void dfs(char[][] array, String key, int row, int col, int index, String path, boolean[][] visited, List<String> paths) {
        if (row < 0 || row >= array.length || col < 0 || col >= array[0].length || visited[row][col]) {
            return;
        }
        if (array[row][col] != key.charAt(index)) {
            return;
        }
        if (index == key.length() - 1) {
            paths.add(path + array[row][col]);
            return;
        }
        visited[row][col] = true;
        dfs(array, key, row - 1, col, index + 1, path + array[row][col], visited, paths);
        dfs(array, key, row + 1, col, index + 1, path + array[row][col], visited, paths);
        dfs(array, key, row, col - 1, index + 1, path + array[row][col], visited, paths);
        dfs(array, key, row, col + 1, index + 1, path + array[row][col], visited, paths);
        visited[row][col] = false;
    }
}