LeetCode #551. Student Attendance Record I

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

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

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种用于检查学生考勤记录是否符合奖励条件的算法。算法通过遍历记录字符串，检查是否存在超过一次的缺席('A')或连续三次以上的迟到('L')，从而判断学生是否有资格获得奖励。

题目描述：

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

class Solution {
public:
    bool checkRecord(string s) {
        int countA=0;
        int countL=0;
        for(int i=0;i<s.size();i++)
        {
            if(s[i]=='L') countL++;
            else countL=0;
            if(s[i]=='A') countA++;
            if(countA>1) return false;
            if(countL>2) return false;
        }
        return true;
    }
};