数据特征：

 以下为负库存的时间段，存在一个日期列表
 时间段一
 2023-08-01
 2023-08-02
 
 时间段二
 2023-08-04
 2023-08-05
 
 时间三
 2023-08-09
 2023-08-10
 2023-08-11

负库存持续天数计算

    public   int findLongestConsecutiveDays(List<LocalDate> dates) {
        if (dates == null || dates.isEmpty()) {
            return 0;
        }

        // 对日期列表进行排序
        Collections.sort(dates);

        int longestConsecutiveDays = 1;
        int currentConsecutiveDays = 1;

        // 遍历排序后的日期列表，找出最长连续天数
        for (int i = 1; i < dates.size(); i++) {
            LocalDate previousDate = dates.get(i - 1);
            LocalDate currentDate = dates.get(i);

            // 使用ChronoUnit计算相邻日期之间的天数差异
            long diffInDays = ChronoUnit.DAYS.between(previousDate, currentDate);

            if (diffInDays == 1) {
                currentConsecutiveDays++;
            } else {
                currentConsecutiveDays = 1;
            }

            longestConsecutiveDays = Math.max(longestConsecutiveDays, currentConsecutiveDays);
        }

        return longestConsecutiveDays;
    }