原题链接:6058. 统计打字方案数
做这道题之前先了解一下这道题:Leecode 70. 爬楼梯 DP/矩阵快速幂
class Solution {
public:
const int mod=1e9+7;
int countTexts(string s) {
int n=s.size();
vector<int> f(n+1);
vector<int> g(n+1);
f[0]=1; g[0]=1;
for(int i=1;i<=n;i++)
{
for( int j=1 ; j<=3 && j<=i; j++ ) f[i]=(f[i]+f[i-j])%mod;
for( int j=1 ; j<=4 && j<=i; j++ ) g[i]=(g[i]+g[i-j])%mod;
}
int cnt=0;
char last='0';
long long res=1;
for(int i=0;i<n;i++)
{
if(s[i]!=last)
{
if(last=='7' || last=='9') res=(res*g[cnt])%mod;
else res=(res*f[cnt])%mod;
cnt=0;last=s[i];
}
cnt++;
}
if(last=='7' || last=='9') res=(res*g[cnt])%mod;
else res=(res*f[cnt])%mod;
return res;
}
};