Description
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].
Discuss
这是一题动态规划。最直接的方法是判断当前pair和前面所有pair相比较取最大值,Code1就是该方法的实现。
还有一种方法是保存当前的最小pair,每次都和最小的pair相比较。例如有两个pair,(1, 3)、(2,4)分别命名为A,B。设置最小pair为last,cur为当前pair,刚开始cur,last都是(1,3),当cur是(2,4)的时候,比较cur[1],last[0]的大小,不能组合,这时比较cur[1]和last[1],取最小值来设置最小的pair,因为比较的时候总是和第二维元素相比较,所以应该取第二维元素小的pair,这时last更新为cur,继续循环判断。
Code 1
class Solution {
public int findLongestChain(int[][] pair) {
if (pair == null || pair.length == 0 || pair[0].length == 0) { return 0; }
Arrays.sort(pair, (o1, o2) -> o1[1] - o2[1]);
int m = pair.length, n = pair[0].length;
int[] dp = new int[m];
int max = 0;
for (int i = 0; i < m; i++) { dp[i] = 1; }
for (int i = 1; i < m; i++) {
for (int j = 0; j < i; j++) if(pair[i][0] > pair[j][1]) {
dp[i] = Math.max(dp[i], dp[j] + 1);
}
max = Math.max(max, dp[i]);
}
return max;
}
}
Code 2
class Solution {
public int findLongestChain(int[][] a) {
if (a == null || a.length == 0 || a[0].length == 0) { return 0; }
Arrays.sort(a, (o1, o2) -> {
if (o1[0] == o2[0]) {
return o1[1] - o2[1];
} else {
return o1[0] - o2[0];
}
});
int count = 1;
//保存当前 最小元素 last[1]最小
int[] last = a[0];
for (int[] x : a) {
//如果第二组元素的 左端 <= 上一组元素的右端 则取二组元素中右端元素最小的值
if (x[0] <= last[1]) {
last = x[1] < last[1] ? x : last;
} else {
last = x;
count++;
}
}
return count;
}
}