如何在数组中找到连通值？

def findConnectedValues(arr):
    def dfs(i, j):
        if i < 0 or i >= len(arr) or j < 0 or j >= len(arr[0]) or visited[i][j] or arr[i][j] != target:
            return
        visited[i][j] = True
        result.append((i, j))
        dfs(i-1, j)  # 上
        dfs(i+1, j)  # 下
        dfs(i, j-1)  # 左
        dfs(i, j+1)  # 右

    if not arr:
        return []
    
    visited = [[False] * len(arr[0]) for _ in range(len(arr))]
    result = []
    
    for i in range(len(arr)):
        for j in range(len(arr[0])):
            if not visited[i][j]:
                target = arr[i][j]
                dfs(i, j)
    
    return result