1722. Minimize Hamming Distance After Swap Operations刷题笔记

最新推荐文章于 2024-11-03 11:19:29 发布

waiting不是违停

最新推荐文章于 2024-11-03 11:19:29 发布

阅读量158

点赞数

分类专栏： LeetCode Python刷题文章标签：深度优先 leetcode 算法

本文链接：https://blog.csdn.net/weixin_44737922/article/details/125920171

版权

LeetCode Python刷题专栏收录该内容

221 篇文章 1 订阅

订阅专栏

参考这篇题解，其中高赞评论有详细解析

class Solution:
    def minimumHammingDistance(self, source: List[int], target: List[int], allowedSwaps: List[List[int]]) -> int:
        res = n = len(source)
        G= [set() for _ in range(n)]
        for i,j in allowedSwaps:
            G[i].add(j)
            G[j].add(i)
        seen = [0]*n
        
        def dfs(i):
            seen[i] = 1
            found.append(i)
            for j in G[i]:
                if not seen[j]:
                    dfs(j)
        
        for i in range(n):
            if seen[i]:
                continue
            found = []
            dfs(i)
            count1 = collections.Counter(source[j] for j in found)
            count2 = collections.Counter(target[j] for j in found)
            res -= sum((count1 & count2).values())
        return res