Merge pull request #310 from yang170/patch-2

Update 0056.合并区间.md

Author: youngyangyang04

problems/0056.合并区间.md

@@ -141,16 +141,7 @@ Java：
 class Solution {
     public int[][] merge(int[][] intervals) {
         List<int[]> res = new LinkedList<>();
-        Arrays.sort(intervals, new Comparator<int[]>() {
-            @Override
-            public int compare(int[] o1, int[] o2) {
-                if (o1[0] != o2[0]) {
-                    return Integer.compare(o1[0],o2[0]);
-                } else {
-                    return Integer.compare(o1[1],o2[1]);
-                }
-            }
-        });
+        Arrays.sort(intervals, (o1, o2) -> Integer.compare(o1[0], o2[0]));
 
         int start = intervals[0][0];
         for (int i = 1; i < intervals.length; i++) {