Leetcode 算法习题 第十四周

646. Maximum Length of Pair Chain

You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.
Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pairs can be formed in this fashion.
Given a set of pairs, find the length longest chain which can be formed. You needn’t use up all the given pairs. You can select pairs in any order.
Example 1:
Input: [[1,2], [2,3], [3,4]]
Output: 2
Explanation: The longest chain is [1,2] -> [3,4]

题目大意

寻找最大长度的链，满足（a,b)->(c,d) 中b

我的解答

class Solution {
public:
    int findLongestChain(vector<vector<int>>& 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<int> &a,vector<int> &b){
        return a[1]<b[1];
    }//必须设置为静态

};