• LeetCode


    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

    class Solution {
        public boolean checkRecord(String s) {
            if (s == null)
                return true;
            int a = 0, l = 1;
            for (int i=0; i<s.length();) {
                char ch = s.charAt(i);
                if (ch == 'A') a ++;
                if (a > 1) return false;
                if (ch == 'L') {
                    while (i < s.length()-1 && s.charAt(++i) == 'L') l ++;
                    if (l > 2) return false;
                    l = 1;
                    if (i < s.length()-1) i--;
                }
                i ++;
            }
            return true;
        }
    }
  • 相关阅读:
    【bozj2287】【[POJ Challenge]消失之物】维护多值递推
    书籍
    图书管理系统-单表的增删改查
    Django之ORM
    app的创建和注册
    登陆示例
    django 静态文件配置
    安装django及配置
    Bootstrap
    导图
  • 原文地址:https://www.cnblogs.com/wxisme/p/7691198.html
Copyright © 2020-2023  润新知