fix: 并查集

Author: lucifer

README.en.md

@@ -136,7 +136,6 @@ The data structures mainly include:
 - [Bloom Filter](./thinkings/bloom-filter-en.md)
 - [String Problems](./thinkings/string-problems-en.md)
 - [Sliding Window Technique](./thinkings/slide-window.en.md)
-- [Union Find](./thinkings/union-find.en.md) 🆕
 - [Trie](./thinkings/trie.en.md) 🆕
 
 ### Anki Flashcards

thinkings/union-find.en.md

@@ -145,10 +145,10 @@ class UF:
         leader_q = self.find(q)
         if self.size[leader_p] < self.size[leader_q]:
             self.parent[leader_p] = leader_q
-            self.size[leader_p] += self.size[leader_q]
+            self.size[leader_q] += self.size[leader_p]
         else:
             self.parent[leader_q] = leader_p
-            self.size[leader_q] += self.size[leader_p]
+            self.size[leader_p] += self.size[leader_q]
         self.cnt -= 1
     def connected(self, p, q):
         return self.find(p) == self.find(q)