我會建議採用以下方法。它使用LocalTime來簡化時間操作,並使用模式來解析輸入。
- 使用正則表達式解析輸入LocalTime s。在地圖使用啓動並將其作爲關鍵,並最終爲值。
- 排序鍵的地圖。
- 使用LocalTime操作檢查區間邊界。不要忘記一天結束的開始。
主要方法:
public static void main(String[] args) {
List<String> dayList = new LinkedList<String>();
dayList.add("00:00-12:59");
dayList.add("13:00-20:30");
dayList.add("18:31-23:59");
Pattern pattern = Pattern.compile("([0-9]{2}:[0-9]{2})-([0-9]{2}:[0-9]{2})");
DayCoverage dayCoverage = new DayCoverage();
for (String day : dayList) {
Matcher matcher = pattern.matcher(day);
if (!matcher.matches()) {
System.err.println("Invalid day entry: " + day);
return;
}
LocalTime start = LocalTime.parse(matcher.group(1));
LocalTime end = LocalTime.parse(matcher.group(2));
dayCoverage.addIntervall(start, end);
}
if (dayCoverage.isComplete()) {
System.out.println("Completes Full Day");
} else {
System.out.println("Not Completes Full Day");
}
}
類DayCoverage:
static class DayCoverage {
private Map<LocalTime, LocalTime> cover = new HashMap<>();
public void addIntervall(LocalTime start, LocalTime end) {
if(end.isBefore(start)){
this.cover.put(end, start);
} else {
this.cover.put(start, end);
}
}
public boolean isComplete() {
if(this.cover.isEmpty()){
System.err.println("Coverage empty.");
return false;
}
Set<LocalTime> startTimes = this.cover.keySet();
List<LocalTime> sortedStartTimes = new ArrayList<>(startTimes);
Collections.sort(sortedStartTimes);
LocalTime first = sortedStartTimes.get(0);
if(! LocalTime.MIN.equals(first)){
System.err.println("Coverage does not start with 00:00.");
return false;
}
LocalTime lastEnd= LocalTime.MIN;
for (LocalTime start : sortedStartTimes) {
if(lastEnd.plus(1, ChronoUnit.MINUTES).isBefore(start)){
System.err.println("Missing coverage between: " + lastEnd + " and " + start);
return false;
}
lastEnd = this.cover.get(start);
}
if(LocalTime.MAX.truncatedTo(ChronoUnit.MINUTES).isAfter(lastEnd)){
System.err.println("Missing coverage between: " + lastEnd + " and 23:59");
return false;
}
return true;
}
}
是否爲您的使用情況下工作嗎? – Makoto
爲什麼不計算差異總和而不將值轉換爲日期? – 11thdimension
@Makoto它的工作正常。我正在檢查一個很好的解決方案 –