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.
Constraints:
1 <= s.length <= 1000
s[i] is either 'A', 'L', or 'P'.
思路一:统计字符,注意迟到是需要连续计算的
public boolean checkRecord(String s) {
int lateCount = 0;
int absentCount = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == 'A') {
absentCount++;
}
}
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == 'L') {
count++;
} else {
lateCount = Math.max(lateCount, count);
count = 0;
}
}
lateCount = Math.max(lateCount, count);
return lateCount < 3 && absentCount < 2;
}
标签:count,easy,lateCount,551,days,int,student,was,leetcode
From: https://www.cnblogs.com/iyiluo/p/17035193.html