Update union_find.md

eadst · web-flow · commit 234883e3b92d · 2021-08-23T08:12:27.000-05:00
diff --git a/data_structure/union_find.md b/data_structure/union_find.md
@@ -142,6 +142,24 @@ class Solution:
         return max_length
 ```
 
+```Python
+class Solution:
+    def longestConsecutive(self, nums: List[int]) -> int:
+        nums_set = set(nums)
+        max_len = 0
+        # start from the lowest
+        for num in nums_set:
+            if num -1 not in nums_set:
+                length = 1
+                cur_num = num
+                while cur_num + 1 in nums_set:
+                    length += 1
+                    cur_num += 1
+                max_len = max(max_len, length)
+        return max_len
+
+```
+
 ### Kruskal's algorithm
 
 ### [minimum-risk-path](https://www.lintcode.com/problem/minimum-risk-path/description)
