题目:
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.Note:
The number of given pairs will be in the range [1, 1000].
Example:
Input: [[1,2], [2,3], [3,4]]
Output: 2
Explanation: The longest chain is [1,2] -> [3,4]
思路:
这道题的题意是:如果前面链对的末元素小于后链对的首元素,那么这两个链对就可以链起来,问最大能链多少个?
我的思路是首先把这些链对按顺序排列,因为每个链对的首元素都小于末元素,所以可以按照每个链对的末元素大小来进行排列。然后把排列后的第一个链对作为当前链对队列尾,遍历链对,找到第一个符合首元素大于位于当前队列尾的链对末元素的链对,然后更新当前链对队列尾以及队列链对个数。
代码:
class Solution {
public:
int findLongestChain(vector<vector<int>>& pairs) {
sort(pairs.begin(), pairs.end(), cmp);
int count = 1;
int now = 0;
for (int i = 1; i < pairs.size(); i++) {
if (pairs[now][1] < pairs[i][0]) {
now = i;
count++;
}
}
return count;
}
private:
static bool cmp(vector<int>& a, vector<int>&b) {
return a[1] < b[1];
}
};