数组中路径的游戏漫游

def find_path(matrix):
    rows = len(matrix)
    cols = len(matrix[0])
    visited = [[False] * cols for _ in range(rows)]

    def backtrack(i, j, prev):
        if i < 0 or i >= rows or j < 0 or j >= cols or visited[i][j] or matrix[i][j] != prev + 1:
            return False
        if matrix[i][j] == rows * cols:
            return True

        visited[i][j] = True

        if backtrack(i-1, j, matrix[i][j]) or \
           backtrack(i+1, j, matrix[i][j]) or \
           backtrack(i, j-1, matrix[i][j]) or \
           backtrack(i, j+1, matrix[i][j]):
            return True

        visited[i][j] = False
        return False

    for i in range(rows):
        for j in range(cols):
            if backtrack(i, j, 0):
                return True

    return False