-
Notifications
You must be signed in to change notification settings - Fork 0
/
551. Student Attendance Record I.py
49 lines (37 loc) · 1.49 KB
/
551. Student Attendance Record I.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
"""
https://leetcode.com/problems/student-attendance-record-i/
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.
"""
from unittest.util import sorted_list_difference
class Solution:
def checkRecord(self, s: str) -> bool:
if s.count("A") >= 2:
return False
late_consecutive_days = 0
for ch in s:
if ch == "L":
late_consecutive_days += 1
if late_consecutive_days >= 3:
return False
else:
late_consecutive_days = 0
return True
solution = Solution()
assert solution.checkRecord("PPALLP") == True
assert solution.checkRecord("PPALLL") == False