LeetCode 551. Student Attendance Record I

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

sqyx008

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

阅读量532

点赞数

分类专栏： LeetCode 文章标签： leetcode string algorithm cpp

本文链接：https://blog.csdn.net/sqyx008/article/details/70213692

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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

Analysis

遍历判断。考细心，要**连续**3次及以上迟到才返回false。

Code

class Solution {
public:
    bool checkRecord(string s) {
        bool countA = false;
        short countL = 0;
        for (char c : s){
            if (c == 'L'){
                if (countL < 2) countL++;
                else return false;
            }
            else countL = 0;
            if (c == 'A'){
                if (!countA) countA = true;
                else return false;
            }
        }
        return true;
    }
};