Leetcode 354 Russian Doll Envelopes

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)

Example:
Given envelopes = [[5,4],[6,4],[6,7],[2,3]], the maximum number of envelopes you can Russian doll is 3 ([2,3] => [5,4] => [6,7]).

俄罗斯套娃问题，类似于二维最长升序序列问题。最长升序序列

先对长升序排列，寻找宽的最长升序序列。

注意，如果长相等，也是不能放进去的。

public class Solution {
 public int maxEnvelopes(int[][] envelopes) {
          if(envelopes == null || envelopes.length == 0 
             || envelopes[0] == null || envelopes[0].length != 2)
              return 0;
          Arrays.sort(envelopes, new MyComparator());//写一个自定义的comparator 来进行排序
          int dp[] = new int[envelopes.length];
          int len = 0;
          for(int[] envelope : envelopes){
              int index = Arrays.binarySearch(dp, 0, len, envelope[1]);
              if(index < 0)
                  index = -(index + 1);
              dp[index] = envelope[1];
              if(index == len)
                  len++;
          }
          return len;
      }


      private  class MyComparator implements Comparator<int[]>{
          
            @Override
            public int compare(int[] arr1, int[] arr2){
                if(arr1[0] == arr2[0])
                    return arr2[1] - arr1[1];//长相等的情况之下，宽就倒序放置，不然会被计算成解的一部分
                else
                    return arr1[0] - arr2[0];
           
            }
      }
}