Python union-find solution

  • 1
    class Solution(object):
        def find(self, i, parent):
            if i!=parent[i]:
                parent[i]=self.find(parent[i], parent)
            return parent[i]
        def union(self, i,j, parent):
            root1 = self.find(i,parent)
            root2 = self.find(j, parent)
            if root1 == root2:
                return True
            parent[root1] = root2
            return False
        def numIslands2(self, m, n, positions):
            :type m: int
            :type n: int
            :type positions: List[List[int]]
            :rtype: List[int]
            result = []
            parent = [-1]*m*n
            dirs = [(0,1), (0,-1), (1,0), (-1,0)]
            num = 0
            for pos in positions:
                idx = pos[0]*n+pos[1]
                parent[idx] = idx
                for d in dirs:
                    i =pos[0]+d[0]
                    j = pos[1]+d[1]
                    new_idx = i*n+j
                    if i<0 or j<0 or i>=m or j>=n or parent[new_idx]==-1:
                    if not self.union(idx, new_idx, parent):
            return result

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.