refactor 354

fishercoder1534 · fishercoder1534 · commit f5afb988339d · 2021-03-30T07:41:22.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_354.java b/src/main/java/com/fishercoder/solutions/_354.java
@@ -8,8 +8,7 @@ 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) {
+            if (envelopes == null || envelopes.length == 0 || envelopes[0].length == 0 || envelopes[0].length != 2) {
                 return 0;
             }
             Arrays.sort(envelopes, (int[] a, int[] b) -> {
