private static Map dateMap = new TreeMap<>();
public static void dateHandle(long startTime, long endTime){
if(startTime>endTime) return;
if (MapUtils.isEmpty(dateMap)) {
dateMap.put(startTime, endTime);
return;
}
//TreeMap能自动根据Key排序,只需要合并交集
//1、有交集则合并
//2、没有交集则添加
Iterator> iterator = dateMap.entrySet().iterator();
while (iterator.hasNext()) {
Map.Entry entry = iterator.next();
Long start = entry.getKey();
Long end = entry.getValue();
if(startTime=start && endTime<=end) {
iterator.remove();
dateMap.put(startTime, end);
} else if(startTimeend) {
iterator.remove();
dateMap.put(startTime, endTime);
} else if(endTime>end && startTime>=start && start