class Solution {
public:
bool checkRecord(string s)
{
int countA = 0, countL = 0;
for(int i = 0; i < s.length(); ++i)
{
if(s[i] == 'A')
countA += 1;
if(countA == 2)
return false;
}
for(int i = 2; i < s.length(); ++i)
{
if(s[i] == 'L' && s[i - 1] == 'L' && s[i - 2] == 'L')
countL += 1;
if(countL == 1)
return false;
}
return true;
}
};
leetcode551. 学生出勤纪录 I
最新推荐文章于 2018-10-24 09:28:00 发布