思路:贪心算法可行。
public static int findLongestChain(int[][] pairs) {
if(pairs.length < 2)return pairs.length;
Arrays.sort(pairs,(a,b)->(a[1] - b[1]));
int r = 1;
int temp = pairs[0][1];
for (int i = 1; i < pairs.length; i++) {
if(temp < pairs[i][0]){
r++;
temp = pairs[i][1];
}
}
return r;
}