• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0301_0400.s0354_russian_doll_envelopes.readme.md Maven / Gradle / Ivy

354\. Russian Doll Envelopes

Hard

You are given a 2D array of integers `envelopes` where envelopes[i] = [wi, hi] represents the width and the height of an envelope.

One envelope can fit into another if and only if both the width and height of one envelope are greater than the other envelope's width and height.

Return _the maximum number of envelopes you can Russian doll (i.e., put one inside the other)_.

**Note:** You cannot rotate an envelope.

**Example 1:**

**Input:** envelopes = [[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]).

**Example 2:**

**Input:** envelopes = [[1,1],[1,1],[1,1]]

**Output:** 1

**Constraints:**

*   `1 <= envelopes.length <= 5000`
*   `envelopes[i].length == 2`
*   1 <= wi, hi <= 104