forked from dnshi/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStudentAttendanceRecord_I.js
More file actions
39 lines (37 loc) · 999 Bytes
/
StudentAttendanceRecord_I.js
File metadata and controls
39 lines (37 loc) · 999 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// Source : https://leetcode.com/problems/student-attendance-record-i
// Author : Dean Shi
// Date : 2017-04-17
/***************************************************************************************
*
* 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
*
*
***************************************************************************************/
/**
* @param {string} s
* @return {boolean}
*/
var checkRecord = function(s) {
return s.split('A').length <= 2 && s.indexOf('LLL') === -1
};