leetcode::coun_vowels_permutation::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	countVowelPermutation (int n)

详细描述

在文件 leetcode.h 第 512 行定义.

成员函数说明

countVowelPermutation()

int leetcode::coun_vowels_permutation::Solution::countVowelPermutation ( int  n )

static

a-0 e-1 i-2 o-3 u-4

在文件 leetcode.cpp 第 1122 行定义.

                                                 {
            unsigned long long end[5] = {1, 1, 1, 1, 1};
            for(int _i = 1; _i < n; _i++) {
                const unsigned long long a = (end[1] + end[2] + end[4]) % 1000000007;
                const unsigned long long e = (end[0] + end[2]) % 1000000007;
                const unsigned long long i = (end[1] + end[3]) % 1000000007;
                const unsigned long long o = end[2] % 1000000007;
                const unsigned long long u = (end[2] + end[3]) % 1000000007;
                end[0]                     = a;
                end[1]                     = e;
                end[2]                     = i;
                end[3]                     = o;
                end[4]                     = u;
            }
            return (end[0] + end[1] + end[2] + end[3] + end[4]) % 1000000007;
        }

被这些函数引用 leetcode::coun_vowels_permutation::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp