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

 判断字符串中是否含有超过1次的‘A‘，或者连续3次’L‘，如果是返回false，否则返回true。遍历字符串数组的同时判断即可。

class Solution {
public:
    bool checkRecord(string s) {
        int A = 0, L = 0;
        for (int i = 0; i != s.size(); i++) {
            if (s[i] == ‘A‘)
                A++;
            if (A > 1)
                return false;
            if (s[i] == ‘L‘ && s[i + 1] == ‘L‘ && s[i + 2] == ‘L‘)
                return false;
        }
        return true;
    }
};
// 3 ms