551. Student Attendance Record I

来源:互联网 发布:bmob数据库 编辑:程序博客网 时间:2024/06/06 09:54

题目来源【Leetcode】

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 l = 0;        for(int i = 0; i < s.length(); i++){            if(s[i] == 'P') l = 0;            else if(s[i] == 'A') {                a++;                l = 0;            }               else  l++;            if(a > 1 || l > 2) return false;        }        return true;    }};
原创粉丝点击