第十四周Russian Doll Envelopes

Russian Doll Envelopes

LeetCode上的354题：https://leetcode.com/problems/russian-doll-envelopes/

题目

You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.

What is the maximum number of envelopes can you Russian doll? (put one inside other)

Note:
Rotation is not allowed.

Example:

Input: [[5,4],[6,4],[6,7],[2,3]]
Output: 3 
Explanation: The maximum number of envelopes you can Russian doll is 3 ([2,3] => [5,4] => [6,7]).

题解

首先对信封进行排序，确保一个信封只能被右边的信封装下，排序条件可以是比较信封长高的总和。排序后的信封为E，令DP[i] 为排序后前i个信封能达到的俄罗斯套娃最大层数，则DP[i] = 1 + max(DP[j]) j = 1, 2, …, i-1且i和j满足E[i]的长高均大于E[j]

代码

class Solution {
public:
    int maxEnvelopes(vector<pair<int, int>>& envelopes) {
        if (envelopes.empty())
            return 0;
        vector<int> dp(envelopes.size(), 0);
        int maxe = 1;
        dp[0] = 1;
        
        sort(envelopes.begin(), envelopes.end(), comp);
        for (int i = 1; i < envelopes.size(); i++) {
            for (int j = 0; j < i; j++)
                if (envelopes[j].first < envelopes[i].first && envelopes[j].second < envelopes[i].second)
                    dp[i] = max(dp[i], dp[j]);
            dp[i]++;
            maxe = max(maxe, dp[i]);
        }
        return maxe;
    }
    
    struct Comp {
        bool operator() (const pair<int, int>& lhs, const pair<int, int>& rhs) {
            return lhs.first+lhs.second < rhs.first+rhs.second;
        }
    }comp;
};