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
题意很简单,直接遍历即可
代码如下:
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>
using namespace std;
class Solution
{
public:
bool checkRecord(string s)
{
bool res = true;
int countA = 0;
for (int i = 0; i < s.length(); i++)
{
if (s[i] == 'A')
countA++;
if (s[i] == 'L' && i + 2 < s.length() && s[i + 1] == 'L' && s[i + 2] == 'L')
{
res = false;
break;
}
}
if (countA > 1)
res = false;
return res;
}
};