LeetCode 551. Student Attendance Record I

Description

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

1. ‘A’ : Absent.
2. ‘L’ : Late.
3. ‘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;
    }
};

Appendix

• Link: https://leetcode.com/problems/student-attendance-record-i
• Run Time: 3ms