时间冲突算法
入参:
Date startTime:开始时间
Date endTime:结束时间
List<Pair<Date,Date>> timePairs:时间段列表
出参:
boolean b:true:会发生时间重合,false:不会发生时间重合
算法简介:
将 从startTime到endTime的时间段 插入到 timePairs这个时间段列表中,校验是否会发生冲突。
代码
public static boolean validateDurationConflict(Date startTime, Date endTime, List<Pair<Date,Date>> timePairs){
if(startTime == null || endTime == null || timePairs == null){
throw new IllegalArgumentException("startTime is null or endTime is null or timePairs is empty when validateDurationConflict !");
}
//过滤null
//排序:按时间片中的开始时间进行从小到大排序
timePairs = timePairs.stream()
.filter(pair -> pair != null && pair.getKey() != null && pair.getValue() != null)
.sorted(Comparator.comparing(Pair::getKey)).collect(Collectors.toList());
if(CollectionUtils.isEmpty(timePairs)){
throw new IllegalArgumentException("timePairs is empty or its element is null when cutDurationIntoTimePairs !");
}
//校验 timePairs 各个时间片之间不能有重合
Pair<Date, Date> pPair = null;
for(int i = 0; i < timePairs.size(); i++){
Pair<Date, Date> pair = timePairs.get(i);
Date sTime = pair.getKey();
Date eTime = pair.getValue();
if(i == 0){
pPair = pair;
continue;
}
if(pPair.getValue().compareTo(sTime) > 0){
throw new IllegalArgumentException("timePairs has time coincide when cutDurationIntoTimePairs !");
}
pPair = pair;
}
//获取第一个开始时间大于startTime的那个时间段的下标
int index = 0;
for(int i=0; i<timePairs.size(); i++){
Pair<Date,Date> timePair = timePairs.get(i);
if(i == 0 && endTime.compareTo(timePair.getKey()) < 0){
return false;
}
if(i == timePairs.size()-1 && startTime.compareTo(timePair.getValue()) > 0){
return false;
}
if(startTime.compareTo(timePair.getKey()) < 0){
index = i;
break;
}
}
if(index > 0){
Pair<Date,Date> firstTimePair = timePairs.get(index-1);
Pair<Date,Date> secondTimePair = timePairs.get(index);
if(startTime.compareTo(firstTimePair.getValue()) > 0
&& endTime.compareTo(secondTimePair.getKey()) < 0){
return false;
}
}
return true;
}