feat: uf

Author: lucifer

leetcode-cheat-0.6.1.zip renamed to leetcode-cheat-0.6.2.zip

@@ -2,7 +2,7 @@
   "manifest_version": 2,
   "name": "leetcode cheatsheet",
   "description": "刷题小助手，made by 力扣加加",
-  "version": "0.6.1",
+  "version": "0.6.2",
   "browser_action": {
     "default_popup": "index.html",
     "default_title": "力扣加加"

public/manifest.json

@@ -5,7 +5,7 @@ export default {
   logo: ufLogo,
   list: [
     {
-      text: "乞丐版",
+      text: "不带权并查集",
       problems: [
         {
           title: "547. 朋友圈",
@@ -28,74 +28,68 @@ export default {
         {
           language: "py",
           text: `
-class UF:
-    parent = {}
-    cnt = 0
-    def __init__(self, M):
-        # 初始化 parent，size 和 cnt
-        for i in range(M):
-            self.parent[i] = i
-            self.cnt += 1
-
-    def find(self, x):
-        while x != self.parent[x]:
-            x = self.parent[x]
-        return x
-    def union(self, p, q):
-        if self.connected(p, q): return
-        self.parent[self.find(p)] = self.find(q)
-        self.cnt -= 1
-    def connected(self, p, q):
-        return self.find(p) == self.find(q)
-            `,
+          class UF:
+            def __init__(self, M):
+                self.parent = {}
+                self.cnt = 0
+                # 初始化 parent，size 和 cnt
+                for i in range(M):
+                    self.parent[i] = i
+                    self.cnt += 1
+        
+            def find(self, x):
+                if x != self.parent[x]:
+                    self.parent[x] = self.find(self.parent[x])
+                    return self.parent[x]
+                return x
+            def union(self, p, q):
+                if self.connected(p, q): return
+                leader_p = self.find(p)
+                leader_q = self.find(q)
+                self.parent[leader_p] = leader_q
+                self.cnt -= 1
+            def connected(self, p, q):
+                return self.find(p) == self.find(q)
+        `,
         },
       ],
     },
     {
-      text: "带路径压缩（递归）",
+      text: "带权并查集",
       problems: [
         {
-          title: "547. 朋友圈",
-          id: "friend-circles",
-        },
-        {
-          title: "721. 账户合并",
-          id: "accounts-merge",
-        },
-        {
-          title: "990. 等式方程的可满足性",
-          id: "satisfiability-of-equality-equations",
-        },
-        {
-          title: "1202. 交换字符串中的元素",
-          id: "smallest-string-with-swaps",
+          title: "399. 除法求值",
+          id: "evaluate-division",
         },
       ],
       codes: [
         {
           language: "py",
           text: `
-class UF:
-    parent = {}
-    size = {}
-    cnt = 0
-    def __init__(self, M):
-        # 初始化 parent，size 和 cnt
-        for i in range(M):
-            self.parent[i] = i
-            self.size[i] = 1
-            self.cnt += 1
-    def find(self, x):
-      while x != self.parent[x]:
-          # 路径压缩
-          self.parent[x] = self.parent[self.parent[x]];
-          x = self.parent[x]
-      return x
-    def union(self, p, q):
-        if self.connected(p, q): return
-        self.parent[self.find(p)] = self.find(q)
-    def connected(self, p, q):
-        return self.find(p) == self.find(q)`,
+        class UF:
+          def __init__(self, M):
+              # 初始化 parent，weight
+              self.parent = {}
+              self.weight = {}
+              for i in range(M):
+                  self.parent[i] = i
+                  self.weight[i] = 0
+      
+          def find(self, x):
+              if self.parent[x] != x:
+                  ancestor, w = self.find(self.parent[x])
+                  self.parent[x] = ancestor
+                  self.weight[x] += w
+              return self.parent[x], self.weight[x]
+          def union(self, p, q, dist):
+              if self.connected(p, q): return
+              leader_p, w_p = self.find(p)
+              leader_q, w_q = self.find(q)
+              self.parent[leader_p] = leader_q
+              self.weight[leader_p] = dist + w_q - w_p
+          def connected(self, p, q):
+              return self.find(p)[0] == self.find(q)[0]
+        `,
         },
       ],
     },