题目链接:https://leetcode.cn/problems/maximum-length-of-pair-chain/
C++ 代码如下:
class Solution {
public:
int findLongestChain(vector<vector<int>>& pairs) {
sort(pairs.begin(), pairs.end(), [](const vector<int> &a, const vector<int> &b) {
return a[1] < b[1];
});
int res = 1, end = pairs[0][1];
for (auto &p : pairs) {
if (p[0] > end) {
res++;
end = p[1];
}
}
return res;
}
};