leetcode1220 2022.1.17

class Solution {
public:
    int countVowelPermutation(int n) {
        vector<long long int> dp;
        dp.resize(5, 1);
        int mod = 1000000007;
        for (int j = 1; j < n; j++)
        {
            long long int a = 0;
            long long int e = 0;
            long long int i = 0;
            long long int o = 0;
            long long int u = 0;
            
            e += (dp[0] % mod);
            a += (dp[1] % mod);
            i += (dp[1] % mod);
            a += (dp[2] % mod);
            e += (dp[2] % mod);
            o += (dp[2] % mod);
            u += (dp[2] % mod);
            i += (dp[3] % mod);
            u += (dp[3] % mod);
            a += (dp[4] % mod);
            dp[0] = a;
            dp[1] = e;
            dp[2] = i;
            dp[3] = o;
            dp[4] = u;
        }
        int ans = 0;
        for (int i = 0; i < 5; i++)
        {
            ans = (ans + dp[i]) % 1000000007;
        }
        return ans;
        
    }
};