LeetCode 354. Russian Doll Envelopes（动态规划）

354. Russian Doll Envelopes

Hard

You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.

What is the maximum number of envelopes can you Russian doll? (put one inside other)

Note:
Rotation is not allowed.

Example:

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

题意

给定一个信封数组，每个信封有长和宽，信封不能旋转，问最多按俄罗斯套娃的方式（小信封套在大信封里）可以装多少个信封。

思路

先把信封数组按{第一维升序，第二维降序}排序，此时俄罗斯套娃问题转化为第二维的乱序数组求最大上升非连续子串问题，最大上升非连续子串问题有O(NlogN)的优化解法，同时排序的时间复杂度也是O(NlogN)，因此总时间复杂度为O(NlogN).

代码

class Solution {
    public int maxEnvelopes(int[][] envelopes) {
        int n = envelopes.length;
        if (n <= 1) {
            return n;
        }
        Arrays.sort(envelopes, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                return o1[0] == o2[0]? o2[1] - o1[1]: o1[0] - o2[0];
            }
        });
        int len = 0, idx = 0;
        int[] dp = new int[n];
        for (int[] env: envelopes) {
            idx = Arrays.binarySearch(dp, 0, len, env[1]);
            idx = idx < 0? -idx - 1: idx;
            dp[idx] = env[1];
            len = idx == len? len + 1: len;
        }
        return len;
    }
}