551. Student Attendance Record I

最新推荐文章于 2024-01-11 19:52:06 发布

原创最新推荐文章于 2024-01-11 19:52:06 发布 · 398 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #String #Student Attendance R

LeetCode 同时被 2 个专栏收录

402 篇文章

订阅专栏

String

36 篇文章

订阅专栏

本文介绍了一种用于检查学生考勤记录是否符合奖励条件的简单算法。该算法通过扫描字符串来判断是否存在超过一次的缺席('A')或者连续三次以上的迟到('L')，并据此决定学生是否有资格获得奖励。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a string representing an attendance record for a student. The record only contains the following three characters:

'A' : Absent.
'L' : Late.
'P' : Present.

A student could be rewarded if his attendance record doesn't contain more than one 'A' (absent) or more than two continuous 'L' (late).

You need to return whether the student could be rewarded according to his attendance record.

Example 1:

Input: "PPALLP"
Output: True

Example 2:

Input: "PPALLL"
Output: False

根据题意，遇到2个以上的‘A’和连续的3个‘L’，返回false，否则返回true。代码如下：

public class Solution {
    public boolean checkRecord(String s) {
        int countL = 0, countA = 0;
        for (char ch: s.toCharArray()) {
            if (ch == 'L') {
                countL ++;
                if (countL >= 3) {
                    return false;
                }
            } else if (ch == 'A') {
                countA ++;
                countL = 0;
                if (countA >= 2) {
                    return false;
                }
            } else {
                countL = 0;
            }
        }
        return true;
    }
}