寻找最大长度的链,满足(a,b)->(c,d) 中b
class Solution { public: int findLongestChain(vector<>>& pairs) { sort(pairs.begin(),pairs.end(),cmp); int count = 1; for(int i = 0; i < pairs.size(); i++){ for(int j = i+1; j < pairs.size(); j++){ if(pairs[i][1] < pairs[j][0]){ count++; i = j; } } } return count; } static bool cmp(vector &a,vector &b){ return a[1]