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]
Note:
The number of given pairs will be in the range [1, 1000].

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/maximum-length-of-pair-chain
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

思路：

1、按数对中b值进行排序，从小到大排序

2、dp[i]表示以pairs[i]结尾的最长数对链的个数

3、边界以pair[i]为结尾的长度都是1，即初始化dp数组为1

4、寻找pairs[j][1]  < pairs[i][0]，只有数对j的b < 数对i的c时，才可以以pairs[i]结尾，才能把dp[i]的值+1

class Solution {
public:
    static bool cmp(vector<int> a, vector<int> b){
        return a[1] < b[1];
    }
    int findLongestChain(vector<vector<int>>& pairs) {
        sort(pairs.begin(), pairs.end(), cmp);
        int size = pairs.size(),res = 0;
        if(size == 0) return 0;
        vector<int> dp(size,1);
        for(int i = 1; i < size; i++){
           for(int j = 0; j < size; j++){
               if(pairs[j][1] < pairs[i][0]){
                   dp[i] = max(dp[j]+1, dp[i]);
               }
           }
            res = max(dp[i],res);
        }
        return res;
    }
};