标签：present ++ har col tps time student nbsp tar
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
题目标签：String
题目让我们检查String s，不能有超过1个A 或者 不能连着有超过2个L。
检查A 很容易，检查L 的话，要检查连续的，只要在不是L的情况下，把 count_L reset 回到2就可以了。具体请看code。
Java Solution:
Runtime beats 98.72%
完成日期：04/21/2018
关键词：String
关键点：reset count_L if this char is not ‘L‘
1 class Solution 2 { 3 public boolean checkRecord(String s) 4 { 5 char [] arr = s.toCharArray(); 6 int count_A = 1; 7 int count_L = 2; 8 9 for(int i=0; i<arr.length; i++) 10 { 11 char c = arr[i]; 12 13 if(c == ‘L‘) // if char is ‘L‘ 14 { 15 count_L--; 16 } // if char is ‘A‘ or ‘P‘ 17 else 18 { 19 if(c == ‘A‘) 20 count_A--; 21 22 count_L = 2; // if this char is not L, set count_L to 2 23 } 24 25 if(count_A < 0 || count_L < 0) 26 return false; 27 } 28 29 return true; 30 } 31 }
参考资料：n/a
LeetCode 题目列表 - LeetCode Questions List
题目来源：https://leetcode.com/
LeetCode 551. Student Attendance Record I (学生出勤纪录 I)
标签：present ++ har col tps time student nbsp tar
原文地址：https://www.cnblogs.com/jimmycheng/p/8905442.html
