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)
Example:
Given envelopes = [[5,4],[6,4],[6,7],[2,3]], the maximum number of envelopes you can Russian doll is 3 ([2,3] => [5,4] => [6,7]).
算法思路
使用动态规划了求解问题。
(1)本题是确定最大的嵌套层数。
(2)我们先对数组排序,然后逐个遍历,根据当前位置之前的最大嵌套层数来确定当前的最大嵌套层数。(有点像LIS问题)
(3)如果之前套娃的width和height均小于当前信封,表明之前的信封可以嵌套在当前信封中,将之前信封的最大嵌套层数加1和当前信封的最大嵌套层数比较来更新当前信封的最大嵌套层数。(状态转移方程)
算法代码
class Solution {
public:
int maxEnvelopes(vector<pair<int, int> >& envelopes) {
vector<int> maxEnv(envelopes.size(), 1);
int res = 0;
sort(envelopes.begin(),envelopes.end());
for(int i = 0; i < envelopes.size(); i++){
for(int j = 0; j < i; j++){
if(envelopes[j].first < envelopes[i].first && envelopes[j].second < envelopes[i].second)
maxEnv[i] = max(maxEnv[i],maxEnv[j] + 1);
}
res = max(res,maxEnv[i]);
}
return res;
}
};