list元素为空的处理

project-order/src/main/java/com/dituhui/pea/order/scheduler/CalcEngineerCapacityScheduler.java

@@ -105,20 +105,23 @@ public class CalcEngineerCapacityScheduler {
         }
         }
         if (occupyInfos.isEmpty()) {
         if (occupyInfos.isEmpty()) {
             return Duration.between(startTime, endTime).toMinutes();
             return Duration.between(startTime, endTime).toMinutes();
-        } else {
-            occupyInfos.sort(Comparator.comparing(OccupyInfo::getBeginTime));
-            // 从 occupyInfos的配置间隙中，获取最大的闲时段，理论上，上面的配置段之间，是不会交叉的，如果交叉，那是存在问题的！
-            List<Long> idlePeriods = new ArrayList<>();
-            LocalDateTime preLast = startTime;
-            for (OccupyInfo o : occupyInfos) {
-                if (o.getBeginTime().isAfter(preLast)) {
-                    idlePeriods.add(Duration.between(startTime, o.getBeginTime()).toMinutes());
-                }
-                preLast = o.getEndTime();
-            }
-            if (preLast.isBefore(endTime)) {
-                idlePeriods.add(Duration.between(preLast, endTime).toMinutes());
+        }
+        occupyInfos.sort(Comparator.comparing(OccupyInfo::getBeginTime));
+        // 从 occupyInfos的配置间隙中，获取最大的闲时段，理论上，上面的配置段之间，是不会交叉的，如果交叉，那是存在问题的！
+        List<Long> idlePeriods = new ArrayList<>();
+        LocalDateTime preLast = startTime;
+        for (OccupyInfo o : occupyInfos) {
+            if (o.getBeginTime().isAfter(preLast)) {
+                idlePeriods.add(Duration.between(startTime, o.getBeginTime()).toMinutes());
             }
             }
+            preLast = o.getEndTime();
+        }
+        if (preLast.isBefore(endTime)) {
+            idlePeriods.add(Duration.between(preLast, endTime).toMinutes());
+        }
+        if (idlePeriods.isEmpty()) {
+            return Duration.between(startTime, endTime).toMinutes();
+        } else {
             return Collections.max(idlePeriods);
             return Collections.max(idlePeriods);
         }
         }
     }
     }