646. 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(vector<vector<int>>& pairs) {
        //贪心的思路，将元素按照第二个值从小排序，遇到满足的就用，因为后面满足的数对没有比前面满足的数对的优势可言，反而因为数值增大有劣势，对于第二个值相等的值，也只可能找一个
    sort(pairs.begin(),pairs.end(),[](const vector<int>& a,const vector<int>& b){return a[1]<b[1];});
        vector<int> pair=pairs[0];
        int count=1;
        for(int i=0;i<pairs.size();i++)
        {
            if(pairs[i][0]>pair[1])
            {
                count++;
                pair=pairs[i];
            }
        }
        return count;
    }
};