leetcode[Student Attendance Record I]//待整理多种解法

最新推荐文章于 2021-09-01 14:09:53 发布

Carmelo_Z

最新推荐文章于 2021-09-01 14:09:53 发布

阅读量286

点赞数 1

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Carmelo_Z/article/details/77284046

版权

LeetCode 专栏收录该内容

148 篇文章 0 订阅

订阅专栏

解法一：

public class Solution {
	//A student could be rewarded if his attendance record doesn't contain more than one 'A' (absent)
	//or more than two [continuous] 'L' (late). 对L的要求是[连续]超过2次
    public boolean checkRecord(String s) {
        int countA = 0;
        int countL = 0;//这个代表最大的countL
        int curCountL = 0;//这个代表当前连续的curCountL
        for(int i = 0; i < s.length(); i++){
        	if(s.charAt(i) == 'A'){
        		countA++;
        	}
        	if(s.charAt(i) == 'L'){
        		curCountL++;
        		countL = Math.max(countL, curCountL);
        	} else{
        		curCountL = 0;
        	}
        	
        	//System.out.println("countA:" + countA + "  countL:" + countL + "  curCountL:" + curCountL);
        }
        
        if(countA > 1 || countL > 2){
        	return false;
        } else{
        	return true;
        }
    }
}