Java 实现区间是否有重叠的方法

其实问一下AI就会给出很好的答案，只是它给出来的答案，验证后有问题，又完善了一下。

步骤分下面几步：

1、判断每个区间，最小和最大是否调转了。

2、根据每个区间开始值排序

3、循环判断上一个的最大值，是否比当前的最小值小。

//1、根据区间开始值 排序
				checkWillcallSurchargeFeeList = checkWillcallSurchargeFeeList.stream().sorted(java.util.Comparator.comparing(WillcallSurchargeFee::getAminWeight,java.util.Comparator.nullsLast(BigDecimal::compareTo))).collect(Collectors.toList());
				checkWillcallSurchargeFeeList.forEach(e->{rangeUnitSet.add(e.getArangeUnit() == null?"":e.getArangeUnit().getAname());});
				
				for(int i=1;i<checkWillcallSurchargeFeeList.size();i++) {
					WillcallSurchargeFee willcallSurchargeFee = checkWillcallSurchargeFeeList.get(i);
					//rangeUnitSet.add(willcallSurchargeFee.getArangeUnit() == null?"":willcallSurchargeFee.getArangeUnit().getAname());
					BigDecimal minNum = willcallSurchargeFee.getAminWeight();
					BigDecimal maxNum = willcallSurchargeFee.getAmaxWeight();
					//2、先判断当前区间，是否有重叠
					if(minNum.compareTo(maxNum) >= 0) {
						flag = false;
						errorinfo.add("初始区间 : " + minNum + " 不能大于或者等于 结束区间 : " + maxNum);
					}
					//3、开始对比两个区间
					WillcallSurchargeFee willcallSurchargeFeeMin = checkWillcallSurchargeFeeList.get(i - 1);
					minNum = willcallSurchargeFeeMin.getAmaxWeight();
					maxNum = willcallSurchargeFee.getAminWeight();
					if(minNum.compareTo(maxNum) > 0) {
						flag = false;
						errorinfo.add("两区间重叠 , 第1区间 [ " + willcallSurchargeFeeMin.getAminWeight() + " 到 " + willcallSurchargeFeeMin.getAmaxWeight()
						+ "] ，第2区间 : [" + willcallSurchargeFee.getAminWeight() + " 到 " + willcallSurchargeFee.getAmaxWeight() + " ]");
					}
				}