#354

Russian Doll Envelopes

master · 1765 · lc hard +32 · verified · 37.7% accepted · 6,452 likes · top 16%

Description

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

One envelope can fit inside another only if both its width and height are strictly smaller 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

Code

1

2

3

class Solution:
    def maxEnvelopes(self, envelopes: List[List[int]]) -> int:

class Solution:
    def maxEnvelopes(self, envelopes: List[List[int]]) -> int: