给你一个整数 n,请返回长度为 n 、仅由元音 (a, e, i, o, u) 组成且按 字典序排列 的字符串数量。
字符串 s 按 字典序排列 需要满足:对于所有有效的 i,s[i] 在字母表中的位置总是与 s[i+1] 相同或在 s[i+1] 之前。
示例 1:
输入:n = 1
输出:5
解释:仅由元音组成的 5 个字典序字符串为 ["a","e","i","o","u"]示例 2:
输入:n = 2
输出:15
解释:仅由元音组成的 15 个字典序字符串为
["aa","ae","ai","ao","au","ee","ei","eo","eu","ii","io","iu","oo","ou","uu"]
注意,"ea" 不是符合题意的字符串,因为 'e' 在字母表中的位置比 'a' 靠后示例 3:
输入:n = 33
输出:66045
题解:初始时,五个元音字母只有[a,e,i,o,u]这样五种可能,以a为开头的有1个,以e开头的有1个....
当n=2时,可以组成["aa","ae","ai","ao","au","ee","ei","eo","eu","ii","io","iu","oo","ou","uu"],以a为开头的有5个,以e开头的有4个,以i开头的有3个,以o开头的有2个,以e开头的有1个。
class Solution:
def countVowelStrings(self, n: int) -> int:
temp = [1,1,1,1,1]
for i in range(1,n):
for j in range(3,-1,-1):
temp[j] += temp[j+1]
return sum(temp)