LeetCode 552 Student Attendance Record II (dp)

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:

1. 'A' : Absent.
2. 'L' : Late.
3. '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. 

Note: The value of n won't exceed 100,000.

题目链接：https://leetcode.com/problems/student-attendance-record-ii/

题目分析：先无脑dp一发，Java超时了，C++可过，0表示'A'，1表示'L'，2表示'P'，则dp[i][j][k][0/1]表示第i个位置选择j，第i-1个位置选择k且'A'是否被选过(0表示未选过，1表示选过)的方案数，每种情况都推一下即可(情况略多)，时间复杂度O(18*n)

class Solution {
public:
    int mod = 1000000007;
    int dp[100001][3][3][2];
    
    int add(int x, int y) {
        return (x % mod + y % mod) % mod;
    }
    
    int checkRecord(int n) {
        if (n == 0) {
            return 0;
        }
        if (n == 1) {
            return 3;
        }
        // 0 => A, 1 => L, 2 => P
        dp[2][0][1][1] = 1;
        dp[2][0][2][1] = 1;
        dp[2][1][0][1] = 1;
        dp[2][2][0][1] = 1;
        
        dp[2][1][1][0] = 1;
        dp[2][1][2][0] = 1;
        
        dp[2][2][1][0] = 1;
        dp[2][2][2][0] = 1;
        for (int i = 3; i <= n; i++) {
            // choose 0 at i
            dp[i][0][1][1] = add(dp[i][0][1][1], dp[i - 1][1][1][0]);
            dp[i][0][1][1] = add(dp[i][0][1][1], dp[i - 1][1][2][0]);
            
            dp[i][0][2][1] = add(dp[i][0][2][1], dp[i - 1][2][1][0]);
            dp[i][0][2][1] = add(dp[i][0][2][1], dp[i - 1][2][2][0]);
            
            // choose 1 at i
            dp[i][1][0][1] = add(dp[i][1][0][1], dp[i - 1][0][1][1]);
            dp[i][1][0][1] = add(dp[i][1][0][1], dp[i - 1][0][2][1]);
            
            dp[i][1][1][0] = add(dp[i][1][1][0], dp[i - 1][1][2][0]);
            dp[i][1][1][1] = add(dp[i][1][1][1], dp[i - 1][1][0][1]);
            dp[i][1][1][1] = add(dp[i][1][1][1], dp[i - 1][1][2][1]);
            
            dp[i][1][2][0] = add(dp[i][1][2][0], dp[i - 1][2][1][0]);
            dp[i][1][2][0] = add(dp[i][1][2][0], dp[i - 1][2][2][0]);
            dp[i][1][2][1] = add(dp[i][1][2][1], dp[i - 1][2][0][1]);
            dp[i][1][2][1] = add(dp[i][1][2][1], dp[i - 1][2][1][1]);
            dp[i][1][2][1] = add(dp[i][1][2][1], dp[i - 1][2][2][1]);
            
            // choose 2 at i
            dp[i][2][0][1] = add(dp[i][2][0][1], dp[i - 1][0][1][1]);
            dp[i][2][0][1] = add(dp[i][2][0][1], dp[i - 1][0][2][1]);
            
            dp[i][2][1][0] = add(dp[i][2][1][0], dp[i - 1][1][1][0]);
            dp[i][2][1][0] = add(dp[i][2][1][0], dp[i - 1][1][2][0]);
            dp[i][2][1][1] = add(dp[i][2][1][1], dp[i - 1][1][0][1]);
            dp[i][2][1][1] = add(dp[i][2][1][1], dp[i - 1][1][1][1]);
            dp[i][2][1][1] = add(dp[i][2][1][1], dp[i - 1][1][2][1]);
            
            dp[i][2][2][0] = add(dp[i][2][2][0], dp[i - 1][2][1][0]);
            dp[i][2][2][0] = add(dp[i][2][2][0], dp[i - 1][2][2][0]);
            dp[i][2][2][1] = add(dp[i][2][2][1], dp[i - 1][2][0][1]);
            dp[i][2][2][1] = add(dp[i][2][2][1], dp[i - 1][2][1][1]);
            dp[i][2][2][1] = add(dp[i][2][2][1], dp[i - 1][2][2][1]);
        }
        int ans = 0;
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                for (int k = 0; k < 2; k++) {
                    ans = add(ans, dp[n][i][j][k]);
                }
            }
        }
        return ans;
    }
};