Merge Intervasl
官方答案代码:作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/merge-intervals/solution/he-bing-qu-jian-by-leetcode-solution/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
答案里对二维数组的排序,还挺新鲜的。
有个解释:https://blog.csdn.net/qq_42647903/article/details/111831826
个人微改:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
public class MergeIntervals {
public static void main(String args[]) {
int intervals[][] = new int[][] {{1,3},{2,6},{8,10},{15,18}};
System.out.println(Arrays.deepToString(merge(intervals)));
}
static int[][] merge(int[][] intervals){
if(intervals.length == 0) {
return intervals;
}
Arrays.sort(intervals,new Comparator<int[]>() {
public int compare(int[] interval1, int[] interval2) {
return interval1[0] - interval2[0];
}
});
List<int[]> merged = new ArrayList<int[]>();
for(int i=0;i<intervals.length;i++) {
int L = intervals[i][0], R = intervals[i][1];
if(merged.size()==0 || merged.get(merged.size()-1)[1]<L) {
merged.add(new int[] {L,R});
}else {
merged.get(merged.size()-1)[1] = Math.max(merged.get(merged.size() - 1)[1], R);
}
}
return merged.toArray(new int[merged.size()][]);
}
}