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.
Test Cases
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
Solution
class Solution {
public int maxEnvelopes(int[][] envelopes) {
Arrays.sort(envelopes, (a, b) -> a[0] != b[0] ? a[0]-b[0] : -a[1]+b[1]);
int n = envelopes.length;
int[] lis = new int[n];
int size = 0;
for(int i=0; i<n; i++) {
int start = 0, end = size;
while(start != end) {
int mid = start + (end-start)/2;
if (envelopes[i][1] > lis[mid]) {
start = mid+1;
} else {
end = mid;
}
}
lis[start] = envelopes[i][1];
if (start == size) ++size;
}
return size;
}
}