如何找到递归回溯迷宫的起点和终点？

def find_start_end(maze):
    start = None
    end = None
    rows = len(maze)
    cols = len(maze[0])

    for i in range(rows):
        for j in range(cols):
            if maze[i][j] == 2:  # 假设起点标记为2，终点标记为3
                start = (i, j)
            elif maze[i][j] == 3:
                end = (i, j)

    return start, end

def backtrack(maze, path, visited, row, col, end):
    if (row, col) == end:
        return True

    directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]
    for dx, dy in directions:
        new_row, new_col = row + dx, col + dy
        if 0 <= new_row < len(maze) and 0 <= new_col < len(maze[0]) and maze[new_row][new_col] == 0 and (new_row, new_col) not in visited:
            visited.add((new_row, new_col))
            path.append((new_row, new_col))
            if backtrack(maze, path, visited, new_row, new_col, end):
                return True
            path.pop()
            visited.remove((new_row, new_col))

    return False

def solve_maze(maze):
    start, end = find_start_end(maze)
    if start is None or end is None:
        return []

    path = [start]
    visited = set([start])
    row, col = start
    if backtrack(maze, path, visited, row, col, end):
        return path

    return []

# 示例迷宫地图
maze = [
    [0, 1, 0, 0, 0],
    [0, 1, 0, 1, 0],
    [0, 0, 0, 0, 0],
    [0, 1, 1, 1, 0],
    [0, 0, 0, 3, 0]
]

path = solve_maze(maze)
print(path)