354 Russian Doll Envelopes 俄罗斯娃娃信封
Posted lina2014
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了354 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]).
详见:https://leetcode.com/problems/russian-doll-envelopes/description/
C++:
class Solution { public: int maxEnvelopes(vector<pair<int, int>>& envelopes) { int res = 0, n = envelopes.size(); vector<int> dp(n, 1); sort(envelopes.begin(), envelopes.end()); for (int i = 0; i < n; ++i) { for (int j = 0; j < i; ++j) { if (envelopes[i].first > envelopes[j].first && envelopes[i].second > envelopes[j].second) { dp[i] = max(dp[i], dp[j] + 1); } } res = max(res, dp[i]); } return res; } };
参考:https://www.cnblogs.com/grandyang/p/5568818.html
以上是关于354 Russian Doll Envelopes 俄罗斯娃娃信封的主要内容,如果未能解决你的问题,请参考以下文章
leetCode 354. Russian Doll Envelopes
leetcode354. Russian Doll Envelopes
leetcode@ [354] Russian Doll Envelopes (Dynamic Programming)
[动态规划] leetcode 354 Russian Doll Envelopes