leetcode 646 python

题目要求：
https://leetcode-cn.com/problems/maximum-length-of-pair-chain/
思路：
很简单的贪心

class Solution:
    def findLongestChain(self, pairs: List[List[int]]) -> int:
        pairs.sort(key=lambda x: x[1])
        end = pairs[0][1]
        res = 1
        for i in range(1, len(pairs)):
            if pairs[i][0] > end:
                end = pairs[i][1]
                res += 1
        return res