#Leetcode# 551. Student Attendance Record I

佚名 6年前 (2019-05-05) 随笔 1991人围观抢沙发百度已收录

https://leetcode.com/problems/student-attendance-record-i/

SRE实战互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

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

代码：

class Solution {
public:
    bool checkRecord(string s) {
        int a = 0;
        int len = s.length();
        for(int i = 0; i < len; i ++) {
            if(s[i] == 'A') a ++;
            if(a > 1) return false;
        }
        string t = "LLL";
        if(s.find(t) != -1) return false;
        return true;
    }
};