zoukankan      html  css  js  c++  java
  • 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

  • 相关阅读:
    BZOJ3439: Kpm的MC密码
    BZOJ2819: Nim
    BZOJ1901: Zju2112 Dynamic Rankings
    Bzoj3230: 相似子串
    Bzoj4504: K个串
    CF609E. Minimum spanning tree for each edge
    bzoj1832: [AHOI2008]聚会
    css 笔记1
    namespace 相关
    cmd 命令
  • 原文地址:https://www.cnblogs.com/xidian2014/p/8837190.html
Copyright © 2011-2022 走看看