551. Student Attendance Record I
来源:互联网 发布:seo全网优化指南 编辑:程序博客网 时间:2024/06/06 01:10
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根据题意,遇到2个以上的‘A’和连续的3个‘L’,返回false,否则返回true。代码如下:
public class Solution { public boolean checkRecord(String s) { int countL = 0, countA = 0; for (char ch: s.toCharArray()) { if (ch == 'L') { countL ++; if (countL >= 3) { return false; } } else if (ch == 'A') { countA ++; countL = 0; if (countA >= 2) { return false; } } else { countL = 0; } } return true; }}
0 0
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- 551. Student Attendance Record I
- Student Attendance Record I
- Student Attendance Record I
- Student Attendance Record I
- LeetCode 551. Student Attendance Record I
- [LeetCode]551. Student Attendance Record I
- LeetCode 551. Student Attendance Record I
- java设计模式——观察者模式
- Linux 访问网络文件共享服务
- LintCode 68 二叉树的中序遍历
- spring cloud学习笔记
- Java知识点(四)——多线程
- 551. Student Attendance Record I
- 编译opencv+opencv_contrib源码实现KCF跟踪算法
- Android 开发 Tip 9 -- TouchDelegate
- 4870: [Shoi2017]组合数问题
- java之hashset与hashmap总结
- Python 中的闭包(2)—— 一个栗子
- 二分贪心 D题
- 边缘独立(marginal independent)的理解及举例
- poco-1.7.8p2-all安装