LeetCode Student Attendance Record I

原题链接在这里：https://leetcode.com/problems/student-attendance-record-i/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

题解：

计算'A'的个数和连续'L'的长度.

Time Complexity: O(s.length()). Space: O(1).

AC Java:

 1 class Solution {
 2     public boolean checkRecord(String s) {
 3         int countA = 0;
 4         int lengthL = 0;
 5         for(int i = 0; i<s.length(); i++){
 6             char c = s.charAt(i);
 7             if(c == 'A'){
 8                 countA++;
 9                 lengthL = 0;
10             }else if(c == 'L'){
11                 lengthL++;
12             }else{
13                 lengthL = 0;
14             }
15             
16             if(countA>1 || lengthL>2){
17                 return false;
18             }
19         }
20         return true;
21     }
22 }

 

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/7526354.html