[leetcode: Python]551. Student Attendance Record I

最新推荐文章于 2022-09-16 01:57:11 发布

原创最新推荐文章于 2022-09-16 01:57:11 发布 · 885 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode

算法专栏收录该内容

150 篇文章

订阅专栏

本文介绍了一种用于检查学生考勤记录是否符合奖励条件的算法。该算法通过判断考勤记录中‘A’（缺席）和连续‘L’（迟到）的数量来决定学生是否有资格获得奖励。

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

方法一：48ms

class Solution(object):
    def checkRecord(self, s):
        """
        :type s: str
        :rtype: bool
        """
        c = collections.Counter(s)
        if c['A'] <= 1:
            if 'LLL' not in s:
                return True
            else:
                return False
        else:
            return False

方法二：35ms

class Solution(object):
    def checkRecord(self, s):
        """
        :type s: str
        :rtype: bool
        """
        return not re.search('A.*A|LLL',s)