551. Student Attendance Record I

最新推荐文章于 2024-09-18 11:04:20 发布

Prozzz777

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量113

点赞数

文章标签： leetcode string

本文链接：https://blog.csdn.net/qq_29689907/article/details/80397144

版权

1.问题描述

You are given a string representing an attendance record for a student. The record only contains the following three characters:
1. ‘A’ : Absent.
2. ‘L’ : Late.
3. ‘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

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

2.问题分析

给你一个代表学生出勤记录的字符串。该记录只包含以下三个字符：’A’：缺席。’L’：晚了。’P’：出在。如果他的出勤记录不包含多于一个“A”（缺席）或超过两个连续的“L”（晚），则可以奖励学生。即根据出勤记录判断A的个数大于1或者出现两个连续的L则返回false，需要注意的是，A和P的出现可以重置L的计数。

3.C++代码

//我的代码：（beats 100%）
bool checkRecord(string s) 
{
    int a=0;
    int l= 0;
    for (int i = 0; i < s.length(); i++)
    {
        char c = s[i];
        if (c == 'A')
        {
            a++;
            l = 0;
        }
        else if (c == 'L')
            l++;
        else if (c == 'P')
        {
            l = 0;
        }
        if (a > 1 || l > 2)
            return false;
    }
        return true;
}