神马文学网集合合并
来源：百度文库 编辑：神马文学网 时间：2024/04/27 14:56:10
用于时间表的合并
时间段的合并工作.
Java代码 ',1)">
public class StarEnds {
LinkedList qeuqeu = new LinkedList();
public StarEnds add(StarEnd other) {
Iterator it = qeuqeu.iterator();
while(it.hasNext()){
StarEnd temp = it.next();
if(StarEnd.isMix(temp, other)){
other.inputOther(temp);
it.remove();
}
}
qeuqeu.add(other);
return this;
}
public Iterator iterator(){
return qeuqeu.iterator();
}
public static void main(String[] args) {
StarEnds ses = new StarEnds();
int[] arr = {1,2,4,5};
for(int i : arr){
StarEnd temp = new StarEnd();
temp.star=i;
temp.end =i+1;
ses.add(temp);
}
System.out.println(ses.qeuqeu);
}
}
class StarEnd{
int star=0;
int end=0;
@Override
public String toString() {
return "{"+star+":"+end+"}";
}
public void inputOther(StarEnd other){
List l = Arrays.asList(star,end,other.star,other.end);
star = Collections.min(l);
end = Collections.max(l);
other.star = 0;
other.end = 0;
}
public static boolean isMix(StarEnd one, StarEnd other) {
if(one==null||other==null){
return false;
}
return one.inStarEnd(other.star)||one.inStarEnd(other.end) ;
}
public boolean inStarEnd(int in){
return (in >= star && in<= end);
}
}
时间段的合并工作.
Java代码 ',1)">
public class StarEnds {
LinkedList
public StarEnds add(StarEnd other) {
Iterator
while(it.hasNext()){
StarEnd temp = it.next();
if(StarEnd.isMix(temp, other)){
other.inputOther(temp);
it.remove();
}
}
qeuqeu.add(other);
return this;
}
public Iterator
return qeuqeu.iterator();
}
public static void main(String[] args) {
StarEnds ses = new StarEnds();
int[] arr = {1,2,4,5};
for(int i : arr){
StarEnd temp = new StarEnd();
temp.star=i;
temp.end =i+1;
ses.add(temp);
}
System.out.println(ses.qeuqeu);
}
}
class StarEnd{
int star=0;
int end=0;
@Override
public String toString() {
return "{"+star+":"+end+"}";
}
public void inputOther(StarEnd other){
List
star = Collections.min(l);
end = Collections.max(l);
other.star = 0;
other.end = 0;
}
public static boolean isMix(StarEnd one, StarEnd other) {
if(one==null||other==null){
return false;
}
return one.inStarEnd(other.star)||one.inStarEnd(other.end) ;
}
public boolean inStarEnd(int in){
return (in >= star && in<= end);
}
}