552-Student-Attendance-Record-Ii
Sat 17 May 2025
https://leetcode.com/problems/student-attendance-record-ii
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def checkRecord(self, n: int) -> int:
kMod = 1_000_000_007
# dp[i][j] := length so far w/ i A's and the latest chars are j L's
dp = [[0] * 3 for _ in range(2)]
dp[0][0] = 1
for _ in range(n):
prev = [A[:] for A in dp]
# Append P
dp[0][0] = (prev[0][0] + prev[0][1] + prev[0][2]) % kMod
# Append L
dp[0][1] = prev[0][0]
# Append L
dp[0][2] = prev[0][1]
# Append A or append P
dp[1][0] = (prev[0][0] + prev[0][1] + prev[0][2] +
prev[1][0] + prev[1][1] + prev[1][2]) % kMod
# Append L
dp[1][1] = prev[1][0]
# Append L
dp[1][2] = prev[1][1]
return (sum(dp[0]) + sum(dp[1])) % kMod
new Solution().checkRecord()
Score: 5
Category: leetcode