551. Student Attendance Record I

最新推荐文章于 2022-09-16 01:57:11 发布

原创最新推荐文章于 2022-09-16 01:57:11 发布 · 241 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

108 篇文章

订阅专栏

本文介绍了一个简单的算法，用于检查学生的考勤记录是否符合奖励条件。算法通过遍历记录字符串，统计缺席和迟到次数来判断学生是否可以得到奖励。

题目来源【Leetcode】

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 a = 0;
        int l = 0;
        for(int i = 0; i < s.length(); i++){
            if(s[i] == 'P') l = 0;
            else if(s[i] == 'A') {
                a++;
                l = 0;
            }   
            else  l++;

            if(a > 1 || l > 2) return false;

        }
        return true;
    }
};