zoukankan      html  css  js  c++  java
  • 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
    

     题目含义:

    您将获得一个代表学生考勤记录的字符串。该记录仅包含以下三个字符:

    ‘A’:没有 
    ‘L’:晚了 
    ‘P’:现在。 
    如果出席记录不包含多于一个“A”(缺席)或超过两个连续的“L”(晚),学生可以获得奖励。

    你需要返回是否可以根据出勤记录来奖励学生。

    示例1: 
    输入: “PPALLP” 
    输出: True 
    示例2: 
    输入: “PPALLL” 
    输出: False

     1     public boolean checkRecord(String s) {
     2         int countA = 0;
     3         char[] letter = s.toCharArray();
     4         int letterLeghth = letter.length;
     5         for (int i=0;i<letterLeghth-2;i++)
     6         {
     7             if (letter[i] == 'A') countA++;
     8             else if (letter[i] == 'L')
     9             {
    10                 if (letter[i+1] == 'L' && letter[i+2]=='L')
    11                     return false;
    12             }
    13         }
    14         if (letterLeghth>=2)
    15         {
    16             if (letter[letterLeghth-1] == 'A') countA++;
    17             if (letter[letter.length-2] == 'A') countA++;  
    18         }
    19         return countA>1?false:true;
    20     }
     
  • 相关阅读:
    Computer Vision 基础学习
    PHP遍历文件夹下的文件时遇到中文目录乱码问题
    Note -「模板」矩阵
    Note -「模板」高斯消元
    Solution -「CF113D」Museum
    【更新中】后缀数组学习笔记
    【题解】ABC225F
    【更新中】2021ZR模拟赛要题记录
    【游记】CSP-S-2021
    【题解】#2019 [zr联赛集训day3]史上第四简洁的题面
  • 原文地址:https://www.cnblogs.com/wzj4858/p/7680412.html
Copyright © 2011-2022 走看看