区间合并
题目描述:给出多组区间,求所有区间的交集
输入描述:多个区间,单个区间用逗号隔开,区间之间用空格隔开,例如:2,6 3,8 6,9
输出描述:将合并后的区间输出,例如2,6 3,8 6,9合并后输出2,9 1,3 2,6 8,10合并后输出1,6 8,10
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
/*
class Interval {
int start,end;
public Interval(int start, int end) {
this.start = start;
this.end = end;
}
}
*/
public class Test2 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String str=sc.nextLine();
List<Interval> list=new ArrayList<>();
String[] s=str.split(" ");
for (int i = 0; i < s.length; i++) {
String[] s1=s[i].split(",");
Interval interval=new Interval(Integer.valueOf(s1[0]),Integer.valueOf(s1[1]));
list.add(interval);
}
List<Interval> list1=new ArrayList<>();
list1=merge(list);
Iterator<Interval> it=list1.iterator();
while(it.hasNext()){
Interval inter=it.next();
if(it.hasNext()==false) System.out.println(inter.start+","+inter.end);
else System.out.print(inter.start+","+inter.end+" ");
}
}
public static List<Interval> merge(List<Interval> intervals) {
List<Interval> intervals1 = new ArrayList<>();
if (intervals.size() == 0) {
return intervals;
}
for (int i = 0; i < intervals.size(); i++) {
for (int j = i+1; j < intervals.size(); j++) {
if (intervals.get(i).start > intervals.get(j).start) {
Interval tem = intervals.get(i);
intervals.set(i,intervals.get(j));
intervals.set(j,tem);
}
}
}
int min = intervals.get(0).start;
int max = intervals.get(0).end;
for (int i = 1; i < intervals.size(); i++) {
//重叠即合并区间
if (intervals.get(i).start <= max) {
max = intervals.get(i).end > max ? intervals.get(i).end : max;
} else {
intervals1.add(new Interval(min,max));
min = intervals.get(i).start;
max = intervals.get(i).end;
}
}
intervals1.add(new Interval(min,max));
return intervals1;
}
}
链表解法
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.LinkedList;
import java.util.Scanner;
class Interval {
int start,end;
public Interval(int start, int end) {
this.start = start;
this.end = end;
}
}
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String str=sc.nextLine();
List<Interval> list=new LinkedList<>();
String[] s=str.split(" ");
for (int i = 0; i < s.length; i++) {
String[] s1=s[i].split(",");
Interval interval=new Interval(Integer.valueOf(s1[0]),Integer.valueOf(s1[1]));
list.add(interval);
}
list=merge(list);
Iterator<Interval> it=list.iterator();
while(it.hasNext()){
Interval inter=it.next();
if(it.hasNext()==false) System.out.println(inter.start+","+inter.end);
else System.out.print(inter.start+","+inter.end+" ");
}
}
public static List<Interval> merge(List<Interval> intervals) {
List<Interval> result = new LinkedList<>();
if (intervals == null || intervals.size() < 1) {
return result;
}
// 先对区间进行排序,使用一个匿名内部类
Collections.sort(intervals, new Comparator<Interval>() {
@Override
public int compare(Interval o1, Interval o2) {
return o1.start - o2.start;
}
});
// 排序后,后一个元素(记为next)的start一定是不小于前一个(记为prev)start的,
// 对于新加入的区间,假设next.start大于prev.end就说明这两个区间是分开的,要添
// 加一个新的区间。否则说明next.start在[prev.start, prev.end]内。则仅仅要看
// next.end是否是大于prev.end,假设大于就要合并区间(扩大)
Interval prev = null;
for (Interval item : intervals) {
if (prev == null || prev.end < item.start) {
result.add(item);
prev = item;
} else if (prev.end < item.end) {
prev.end = item.end;
}
}
return result;
}
}