[LeetCode]551. Student Attendance Record I(根据学生出勤记录判断是否应获奖金)

551. Student Attendance Record I

原题链接
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

题目大意：
您将获得一个代表学生考勤记录的字符串。 该记录仅包含以下三个字符：
‘A’：旷课
‘L’：迟到
‘P’：在场
如果出席记录“A”（旷课）不超过一次或“L”（迟到）连续不超过两次，学生可以获得奖励。
你需要返回是否可以根据出勤记录来奖励学生。

思路：

• 判断字符串长度是否小于等于1，是的话，不管字符串是什么，学生必定可以获得奖励
• 定义两个int类型的数，记录旷课次数Acount和连续迟到次数ContinuousLcount
• 遍历字符串，如果是A就Acount++(这种情况下就不是连续迟到，ContinuousLcount变成0)， 如果是L就ContinuousLcount++，否则就不是连续迟到，ContinuousLcount 赋值0。
• Acount>1 或者 ContinuousLcount>2时就不能获得奖励

代码如下：

C++

#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
    bool checkRecord(string s) {
        if(s.size() <= 1)
            return true;
        int Acount = 0;
        int ContinuousLcount = 0;
        for(int i=0; i<s.size(); i++){
            if(s[i] == 'A'){
               Acount++;
               ContinuousLcount = 0;
            }
            else if(s[i] == 'L')
                ContinuousLcount++;
            else
                ContinuousLcount = 0;
            if(Acount>1 || ContinuousLcount>2)
                return false;
        }
        return true;
    }
};
int main()
{
    Solution a;
    string s;
    cin >> s;
    cout << s.size() << endl;
    //cout << true << endl; //1
    //cout << false << endl; //0
    cout << a.checkRecord(s) << endl;
    return 0;
}