552. Student Attendance Record II

552. Student Attendance Record II

Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer may be very large, return it after mod 109 + 7.

A student attendance record is a string that only contains the following three characters:

‘A’ : Absent.
‘L’ : Late.
‘P’ : Present.
A record is regarded as rewardable if it doesn’t contain more than one ‘A’ (absent) or more than two continuous ‘L’ (late).

Example 1:
Input: n = 2
Output: 8
Explanation:
There are 8 records with length 2 will be regarded as rewardable:
“PP” , “AP”, “PA”, “LP”, “PL”, “AL”, “LA”, “LL”
Only “AA” won’t be regarded as rewardable owing to more than one absent times.

题目大意：
学生出席记录，A表示缺席，L表示迟到，P表示出席，不能有两次缺席，不能有连续三次迟到，找到长度为n且满足上述条件的出席表的个数。

思路：
动态规划题目
我们用p[n][a][l]来表示，长度为n且缺席次数最多为a连续迟到次数最多为l的个数
则p[i][a][l] = p[i-1][a][2] //只能是一个P
+ p[i-1][a-1][2] //可以是一个A
+ p[i-1][a][k-1] //可以是一个L

依次类推可以得到答案

class Solution {
public:
    int checkRecord(int n) {
        int MOD = 1000000007;

        int f[n+1][2][3];
        memset(f,0,sizeof(f));
        for(int i =0 ;i<=n;i++){
            for(int j=0;j<2;j++){
                for(int k=0;k<3;k++){
                    f[0][j][k]=1;
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=0;j<2;j++){
                for(int k=0;k<3;k++){
                    int val = f[i-1][j][2];//P only 
                    if(j>0) val = (val+f[i-1][j-1][2])%MOD; //Could be A
                    if(k>0) val = (val+f[i-1][j][k-1])%MOD; //Could be L
                    f[i][j][k] = val;
                }
            }
        }
        return f[n][1][2];
    }
};