| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.StudentAttendanceRecord1; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class StudentAttendanceRecord1Simulation : IStudentAttendanceRecord1 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public bool CheckRecord(string s) |
| | 2 | 24 | | { |
| | 2 | 25 | | var lateCount = 0; |
| | 2 | 26 | | var absentCount = 0; |
| | | 27 | | |
| | 26 | 28 | | for (var i = 0; i < s.Length; i++) |
| | 12 | 29 | | { |
| | 12 | 30 | | var c = s[i]; |
| | | 31 | | |
| | 12 | 32 | | switch (c) |
| | | 33 | | { |
| | | 34 | | case 'A': |
| | 2 | 35 | | { |
| | 2 | 36 | | absentCount++; |
| | | 37 | | |
| | 2 | 38 | | if (absentCount > 1) |
| | 0 | 39 | | { |
| | 0 | 40 | | return false; |
| | | 41 | | } |
| | | 42 | | |
| | 2 | 43 | | lateCount = 0; |
| | | 44 | | |
| | 2 | 45 | | break; |
| | | 46 | | } |
| | | 47 | | case 'L': |
| | 5 | 48 | | { |
| | 5 | 49 | | lateCount++; |
| | | 50 | | |
| | 5 | 51 | | if (lateCount > 2) |
| | 1 | 52 | | { |
| | 1 | 53 | | return false; |
| | | 54 | | } |
| | | 55 | | |
| | 4 | 56 | | break; |
| | | 57 | | } |
| | | 58 | | default: |
| | 5 | 59 | | lateCount = 0; |
| | | 60 | | |
| | 5 | 61 | | break; |
| | | 62 | | } |
| | 11 | 63 | | } |
| | | 64 | | |
| | 1 | 65 | | return true; |
| | 2 | 66 | | } |
| | | 67 | | } |