第十周：( LeetCode552) Student Attendance Record II（c++）

最新推荐文章于 2020-07-17 17:06:37 发布

marlonlyh

最新推荐文章于 2020-07-17 17:06:37 发布

阅读量332

点赞数 1

分类专栏：算法分析与设计文章标签： leetcode 552 动态规划

本文链接：https://blog.csdn.net/marlonlyh/article/details/70526706

版权

算法分析与设计专栏收录该内容

41 篇文章 0 订阅

订阅专栏

这是一道动态规划的题目，leetcode划分的难度为Hard。其实思路并不难，但是 AC的过程略有曲折。

原题：
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 10^9 + 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.

思路：本题应该不难看出是动态规划的题。用dp[n]表示长度为n的字符串符合要求的个数，dp[n]肯定与dp[n-1]有关。但直接构造dp[n]与dp[n-1]关系的方程恐怕不好找。但如果我们把dp[n]分为以下几个子状态，问题就容易多了：（1）end_a[i]表示以a结尾符合条件的个数（2）end_p_hasa[i]表示以p结尾包含a符合条件的个数（3）end_p_noa[i]表示以p结尾不包含a符合条件的个数（4）end_l_hasa[i]表示以l结尾（不包括ll结尾的情况）包含a符合条件的个数（5）end_l_noa[i]表示以l结尾（不包括ll结尾的情况）不包含a符合条件的个数（6）end_ll_hasa[i]表示以ll结尾包含a符合条件的个数（7）end_ll_noa[i]表示以ll结尾不包含a符合条件的个数。状态转移方程具体看代码，在此不赘述。

代码一：（超时）

class Solution {
public:
    int checkRecord(int n) {
        long long end_a[n+1],end_p_hasa[n+1],end_p_noa[n+1],end_l_hasa[n+1],end_l_noa[n+1],end_ll_hasa[n+1],end_ll_noa[n+1];
        if(n==1)
            return 3;
        if(n==2)
            return 8;
        end_a[2]=2;
        end_p_hasa[2]=1;
        end_p_noa[2]=2;
        end_l_hasa[2]=1;
        end_l_noa[2]=1;
        end_ll_hasa[2]=0;
        end_ll_noa[2]=1;
        for(int i=3;i<=n;i++){
            end_a[i]=(end_p_noa[i-1]+end_l_noa[i-1]+end_ll_noa[i-1])%1000000007;
            end_p_hasa[i]=(end_a[i-1]+ end_p_hasa[i-1]+end_l_hasa[i-1]+end_ll_hasa[i-1])%1000000007;
            end_p_noa[i]=(end_p_noa[i-1]+end_l_noa[i-1]+end_ll_noa[i-1])%1000000007;
            end_l_hasa[i]=(end_a[i-1]+end_p_hasa[i-1])%1000000007;
            end_l_noa[i]=end_p_noa[i-1];
            end_ll_hasa[i]=end_l_hasa[i-1];
            end_ll_noa[i]=end_l_noa[i-1];
        }
        return (end_a[n]+end_p_hasa[n]+end_p_noa[n]+end_l_hasa[n]+end_l_noa[n]+end_ll_hasa[n]+end_ll_noa[n])%1000000007;
    }
};

以上代码返回当n=100000时，超时！一开始我一直在想怎么从算法上优化，比如每次直接从字符串的后面加入2个或者3个字符，即找出dp[n]与dp[n-2]，或者dp[n]与dp[n-3]的关系，这也是一种思路，但没有去实现。因为在我把long long 改为int之后，就已经过了。当然这里要对int的范围有所了解，注意及时mod除，免得int越界。以下是AC代码。

代码二：（42ms通过）

class Solution {
public:
    int checkRecord(int n) {
        int end_a[n+1],end_p_hasa[n+1],end_p_noa[n+1],end_l_hasa[n+1],end_l_noa[n+1],end_ll_hasa[n+1],end_ll_noa[n+1];
        if(n==1)
            return 3;
        if(n==2)
            return 8;
        end_a[2]=2;
        end_p_hasa[2]=1;
        end_p_noa[2]=2;
        end_l_hasa[2]=1;
        end_l_noa[2]=1;
        end_ll_hasa[2]=0;
        end_ll_noa[2]=1;
        for(int i=3;i<=n;i++){
            end_a[i]=((end_p_noa[i-1]+end_l_noa[i-1])%1000000007+end_ll_noa[i-1])%1000000007;
            end_p_hasa[i]=((end_a[i-1]+ end_p_hasa[i-1])%1000000007+(end_l_hasa[i-1]+end_ll_hasa[i-1])%1000000007)%1000000007;
            end_p_noa[i]=end_a[i];
            end_l_hasa[i]=(end_a[i-1]+end_p_hasa[i-1])%1000000007;
            end_l_noa[i]=end_p_noa[i-1];
            end_ll_hasa[i]=end_l_hasa[i-1];
            end_ll_noa[i]=end_l_noa[i-1];
        }
        return (((end_a[n]+end_p_hasa[n])%1000000007+(end_p_noa[n]+end_l_hasa[n])%1000000007)%1000000007+((end_l_noa[n]+end_ll_hasa[n])%1000000007+end_ll_noa[n])%1000000007)%1000000007;
    }
};