华为OD机试-考勤信息-双指针（JAVA 2025B卷）

暴力解法

import java.util.*;
public class Attendance {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Integer a = Integer.parseInt(sc.nextLine());
        List<String> strings = new ArrayList<>();
        for(int i=0;i<a;i++){
            strings.add(sc.nextLine());
        }
        solve(strings);
    }
    private static void solve(List<String> strings){
        for (int j=0;j<strings.size();j++) {
            String[] split = strings.get(j).split("\\s+");
            int queqin = 0;
            boolean flag2=false;
            int all = 0;
            for(int i =0;i<split.length;i++){
                if(split[i].equals("absent")){
                    queqin++;
                }
                if(i%7==0){//连续七次
                    all = 0;
                }
                if(split[i].equals("absent")||split[i].equals("late")||split[i].equals("leaveearly")){
                    all++;
                }
                if(i+1<split.length&&((split[i].equals("late") && split[i+1].equals("late"))||
                        (split[i].equals("leaveearly") && split[i+1].equals("leaveearly")))){
                    flag2 = true;
                }
            }
            boolean queqinFlag = queqin > 1;
            boolean allflag = all > 3;

            if(queqinFlag||flag2||allflag){
                System.out.print(false);
            }else{
                System.out.print(true);
            }
            if(j!= strings.size()-1){
                System.out.print(" ");
            }

        }
    }
}