551. Student Attendance Record I

最新推荐文章于 2024-01-11 19:52:06 发布

原创最新推荐文章于 2024-01-11 19:52:06 发布 · 920 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

220 篇文章

订阅专栏

本文介绍了一种用于检查学生考勤记录是否符合奖励条件的简单算法。该算法通过遍历字符串来计数缺勤('A')和迟到('L')的情况，并确保缺勤不超过一次且连续迟到不超过两次。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

public class Solution {
    public boolean checkRecord(String s) {
        int a = 0;
		int l = 0;
		for (int i = 0; i < s.length(); ++i) {
			char c = s.charAt(i);
			if (c == 'P') {
				l = 0;
				continue;
			} else if (c == 'A') {
				l = 0;
				a++;
				if (a > 1)
					return false;
			} else {
				l++;
				if (l > 2)
					return false;
			}
		}
		return true;
    }
}