Time: 190 ms (96.85%), Space: 17 MB (14.26%) - LeetHub

Author: snowphone

0646-maximum-length-of-pair-chain/0646-maximum-length-of-pair-chain.py

@@ -0,0 +1,12 @@
+from operator import itemgetter
+class Solution:
+    def findLongestChain(self, pairs: List[List[int]]) -> int:
+        pairs.sort(key=itemgetter(1))
+
+        ans = pairs[:1]
+
+        for b, e in pairs[1:]:
+            if ans[-1][1] < b:
+                ans.append((b, e))
+
+        return len(ans)