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].

问题分析

本题其实是最长上升子序列的变形版，方法是类似的，只需要在做比较时进行一些修改就可以了

解决代码

class Solution {
public:
    int findLongestChain(vector<vector<int>>& pairs) {
        sort(pairs.begin(), pairs.end(), [](auto a, auto b){return a[0] < b[0];});

        vector<int>dp(pairs.size(), 1);


        for (int i = 0; i < pairs.size(); i++) {
            for (int j = 0; j < i; j++)
                if (pairs[i][0] > pairs[j][1]) {
                    dp[i] = max(dp[i], dp[j] + 1);
                }
        }
        return dp[pairs.size()-1];
    }
};