-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathcheckRecord.go
More file actions
43 lines (36 loc) · 895 Bytes
/
Copy pathcheckRecord.go
File metadata and controls
43 lines (36 loc) · 895 Bytes
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
/* https://leetcode.com/problems/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:
'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
*/
package lstring
func checkRecord(s string) bool {
countA, countL := 0, 0
for _, c := range s {
switch c {
case 'A':
countA++
if countA > 1 {
return false
}
countL = 0
case 'L':
countL++
if countL > 2 {
return false
}
case 'P':
countL = 0
}
}
return true
}