LeetCode – 551. Student Attendance Record I

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
 唯一要注意的是,他是连续三个L

public class Solution {
    public boolean checkRecord(String s) {
        int a = 0;
        for(int i=0;i<s.length();i++){
            if(s.charAt(i) == 'A'){
                a++;
                if(a>1){
                    return false;
                }
            }
            if(s.charAt(i) == 'L' && i+2<s.length() && s.charAt(i+1) == 'L' && s.charAt(i+2) == 'L'){
                return false;
            }
                
        }
        return true;
    }
}

喜欢的话订阅一个呗~第一时间收到文章更新哟~

发表评论

电子邮件地址不会被公开。