算法题-考勤信息

原创

已于 2024-02-02 00:00:19 修改 · 470 阅读

11 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #windows

于 2024-02-01 00:34:37 首次发布

import java.util.*;
public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            int num = sc.nextInt();
            sc.nextLine();
            StringBuilder sb = new StringBuilder();
            for(int i = 0;i < num;i ++){
                String[] split = sc.nextLine().split("\\s+");
                List<String> list = Arrays.asList(split);
                //缺勤超过一次 || 任意7天缺勤/迟到/早退超过3次 || 连续迟到或者早退
                if(absentMoreThanOne(list) || isBadAttendance(list) ||  
                isNotContinuousAttendance(list)){
                    sb.append("false");
                    sb.append(" ");
                    continue;
                }
                sb.append("true");
                sb.append(" ");
            }
            System.out.println(sb.substring(0,sb.length()));
        }
    }
    public static boolean absentMoreThanOne(List