Package g0301_0400.s0354_russian_doll_envelopes

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    354 - Russian Doll Envelopes\.

    Hard

    You are given a 2D array of integers envelopes where <code>envelopesi = w<sub>i</sub>, h<sub>i</sub></code> 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:

    • <code>1 <= envelopes.length <= 10<sup>5</sup></code>

    • envelopes[i].length == 2

    • <code>1 <= w<sub>i</sub>, h<sub>i</sub><= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxEnvelopes(Array<IntArray> envelopes)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait