354. Russian Doll Envelopes
https://leetcode.com/problems/russian-doll-envelopes/description/
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 <= 105envelopes[i].length == 21 <= wi, hi <= 105
---
Intuition
---
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public int maxEnvelopes(int[][] envelopes) { | |
| // Sort first dimension ascending, second dimension descending | |
| // Envelopes with same first dimension are in different LIS | |
| Arrays.sort( | |
| envelopes, | |
| (a, b) -> a[0] == b[0] ? Integer.compare(b[1], a[1]) : Integer.compare(a[0], b[0]) | |
| ); | |
| int[] dim = new int[envelopes.length]; | |
| for (int i = 0; i < envelopes.length; i++) { | |
| dim[i] = envelopes[i][1]; | |
| } | |
| // Length of longest increasing subsequence on second dimension | |
| TreeSet<Integer> set = new TreeSet<Integer>(); | |
| for (int num: dim) { | |
| Integer ceil = set.ceiling(num); | |
| if (ceil != null) { | |
| set.remove(ceil); | |
| } | |
| set.add(num); | |
| } | |
| return set.size(); | |
| } | |
| } |
