在不超出边界的情况下在2D数组中查找相邻像素

def dfs_search(image, visited, row, col, target_pixel):
    # 检查边界条件
    if row < 0 or row >= len(image) or col < 0 or col >= len(image[0]):
        return False
    
    # 检查是否已经访问过该像素
    if visited[row][col]:
        return False
    
    # 检查像素是否与目标像素相同
    if image[row][col] == target_pixel:
        return True
    
    # 标记当前像素为已访问
    visited[row][col] = True
    
    # 递归地搜索相邻像素
    if dfs_search(image, visited, row-1, col, target_pixel) or \
       dfs_search(image, visited, row+1, col, target_pixel) or \
       dfs_search(image, visited, row, col-1, target_pixel) or \
       dfs_search(image, visited, row, col+1, target_pixel):
        return True
    
    return False

def find_adjacent_pixels(image, start_row, start_col):
    # 获取起始像素的颜色值
    target_pixel = image[start_row][start_col]
    
    # 创建一个二维数组来记录已访问过的像素
    visited = [[False] * len(image[0]) for _ in range(len(image))]
    
    # 调用深度优先搜索算法查找相邻像素
    return dfs_search(image, visited, start_row, start_col, target_pixel)