# 551. Student Attendance Record I

## Problem

You are given a string s representing an attendance record for a student where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:

- ‘A’: Absent.
- ‘L’: Late.
- ‘P’: Present.

The student is eligible for an attendance award if they meet both of the following criteria:

- The student was absent (‘A’) for strictly fewer than 2 days total.
- The student was never late (‘L’) for 3 or more consecutive days.

Return true if the student is eligible for an attendance award, or false otherwise.

Example 1:

```
Input: s = "PPALLP"
Output: true
Explanation: The student has fewer than 2 absences and was never late 3 or more consecutive days.
```

Example 2:

```
Input: s = "PPALLL"
Output: false
Explanation: The student was late 3 consecutive days in the last 3 days, so is not eligible for the award.
```

Constraints:

- 1 <= s.length <= 1000
- s[i] is either ‘A’, ‘L’, or ‘P’.

## Code

```
class Solution {
public boolean checkRecord(String s) {
int countA = 0;
int countL = 0;
for(int c : s.toCharArray()) {
if(c == 'A') countA++;
if(c == 'L') {
countL++;
} else {
countL = 0;
}
if(countA == 2 || countL == 3) return false;
}
return true;
}
}
```

```
class Solution {
public boolean checkRecord(String s) {
return !s.matches(".*LLL.*|.*A.*A.*");
}
}
```

按 <- 键看上一题！
549. Binary Tree Longest Consecutive Sequence II

按 -> 键看下一题！
553. Optimal Division