refactor 354

fishercoder1534 · fishercoder1534 · commit 3985a999c3ae · 2019-01-23T06:39:57.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_354.java b/src/main/java/com/fishercoder/solutions/_354.java
@@ -16,32 +16,34 @@
 
  */
 public class _354 {
-    /**reference: https://discuss.leetcode.com/topic/47469/java-nlogn-solution-with-explanation*/
-    public int maxEnvelopes(int[][] envelopes) {
-        if (envelopes == null || envelopes.length == 0
+    public static class Solution1 {
+        /** reference: https://discuss.leetcode.com/topic/47469/java-nlogn-solution-with-explanation */
+        public int maxEnvelopes(int[][] envelopes) {
+            if (envelopes == null || envelopes.length == 0
                 || envelopes[0].length == 0 || envelopes[0].length != 2) {
-            return 0;
-        }
-        Arrays.sort(envelopes, (int[] a, int[] b) -> {
+                return 0;
+            }
+            Arrays.sort(envelopes, (int[] a, int[] b) -> {
                     if (a[0] == b[0]) {
                         return b[1] - a[1];
                     } else {
                         return a[0] - b[0];
                     }
                 }
-        );
-        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++;
+            );
+            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;
         }
-        return len;
     }
 }
