Leetcode 题解 - 动态规划-分割整数(14):一组整数对能够构成的最长链

[LeetCode] 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:

1. The number of given pairs will be in the range [1, 1000].

 

class Solution {
    public int findLongestChain(int[][] pairs) {
        if(pairs == null || pairs.length == 0)
            return 0;
        Arrays.sort(pairs,(a,b) ->(a[0] - b[0]));//有小到大按前区间排序
        int n = pairs.length;
        int[] dp = new int[n];
        Arrays.fill(dp, 1);
        for(int i = 1; i < n; i++)
            for(int j=0; j < i; j++){
                if(pairs[i][0] > pairs[j][1])
                    //还是爬梯子 找到d[j]对应的个数再加1就是了
                    dp[i] = Math.max(dp[j] + 1, dp[i]);
            }
        //最后一个的前区间一定是最大的  前面排完的所有情况它肯定都包含了 只多不少
//像这种顺序性的 最后一个一般都是囊括了所有情况
        return dp[n - 1];
    }
}

这道题还可用贪心算法求解