首页 > 代码库 > 551. Student Attendance Record I(LeetCode)
551. Student Attendance Record I(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
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)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。