(Easy) Student Attendance Record I LeetCode

Description:

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

 

Accepted
56,021
Submissions
123,047
 

Solution:

 
class Solution {
    public boolean checkRecord(String s) {
        
        if(s.length()==0||s==null){
            return false;
        }
        
        boolean check_A_flag = false;
        
        boolean check_L_flag = false;
        int A_count = 0;
        int L_count = 0;
        for(int i = 0; i<s.length();i++){
            
            if(s.charAt(i)=='A'){
                
                A_count++;
                if(A_count>1){
                    check_A_flag = true;
                }
            }
            
            
            if(s.charAt(i)=='L'){
                L_count++;
                
                if(L_count>=3){
                    check_L_flag = true;
                }
            }
            else{
                
                if(L_count<3){
                    
                    L_count = 0;
                }
                
            }
            
            
        }
        
        return (!(check_A_flag||check_L_flag));
        
    }
}

 

转载于:https://www.cnblogs.com/codingyangmao/p/11391628.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值