551. Student Attendance Record I（LeetCode）

标签：represent   one   for   check   follow   rac   eth   out   contain   

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

 1 class Solution {
 2 public:
 3     bool checkRecord(string s) {
 4         int len = s.size();
 5         int num=0;
 6         for(int i=0;i<len;i++)
 7         {
 8             if(s[i]==‘A‘)
 9             num++;
10         }
11         bool b = true;
12         if (num>1)
13             b = false;
14         for(int i=0;i<len-2;i++)
15         {
16             if(s[i]==‘L‘&&s[i+1]==‘L‘&&s[i+2]==‘L‘)
17             b=false;
18         }
19         return b;
20     }
21 };

551. Student Attendance Record I（LeetCode）

标签：represent   one   for   check   follow   rac   eth   out   contain   

原文地址：http://www.cnblogs.com/wujufengyun/p/6830670.html