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].
按照数组第一个元素排序: (1,100),(8,9), (10,11) 。不能通过比较 [i][end] 和 [i+1][begin] 来增加链。
而如果按照数组第二个元素排序: (8,9) ,(10,11), (1,100),那么则可以通过比较 [i][end] 和 [i+1][begin] 来增加
关于排序:Arrays.sort(pairs, (a,b) -> a[1] - b[1]);
Java Lambda 表达式(又名闭包(Closure)匿名函数) 笔记
public class Solution {
public int findLongestChain(int[][] pairs) {
if(pairs==null || pairs.length==0) return 0;
Arrays.sort(pairs, new Comparator<int[]>(){
public int compare(int[] a, int[] b){
return a[1]-b[1];
}
});
int res=1;
int max;
max=pairs[0][1];
for(int i=1; i<pairs.length; i++){
if(pairs[i][0]>max){
max=pairs[i][1];
res++;
}
}
return res;
}
}
方法二:无论是按照数组的第一个元素排序,还是按照数组的第二个元素排序,这个问题都能转化为用DP解决。
以下是用DP解决的。dp[i]储存的是从i结束的链表长度最大值。首先初始化每个dp[i]为1。然后对于每个dp[i],找在 i 前面的索引 0~j,如果存在可以链接在i 前面的数组,且加完后大于dp[i]之前的值,那么则在dp[j]的基础上+1.
public class Solution {
public int findLongestChain(int[][] pairs) {
Arrays.sort(pairs, (a, b) -> (a[0] - b[0]));
int i, j, max = 0, n = pairs.length;
int dp[] = new int[n];
for (i = 0; i < n; i++) dp[i] = 1;
for (i = 1; i < n; i++)
for (j = 0; j < i; j++)
if (pairs[i][0] > pairs[j][1] && dp[i] < dp[j] + 1)
dp[i] = dp[j] + 1;
for (i = 0; i < n; i++) if (max < dp[i]) max = dp[i];
return max;
}
}
回顾一下DP的思想:
DP=recursion + memorization
——memorize(remember) and re-use solutions to subproblems that help solve the problem.