[leetcode] 1641. Count Sorted Vowel Strings

Description

Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted.

A string s is lexicographically sorted if for all valid i, s[i] is the same as or comes before s[i+1] in the alphabet.

Example 1:

Input: n = 1
Output: 5
Explanation: The 5 sorted strings that consist of vowels only are ["a","e","i","o","u"].

Example 2:

Input: n = 2
Output: 15
Explanation: The 15 sorted strings that consist of vowels only are
["aa","ae","ai","ao","au","ee","ei","eo","eu","ii","io","iu","oo","ou","uu"].
Note that "ea" is not a valid string since 'e' comes after 'a' in the alphabet.

Example 3:

Input: n = 33
Output: 66045

Constraints:

• 1 <= n <= 50

分析

题目的意思是：给定长度n，求出所有长度为n的字符串组合，字符串组合要求排序后的。我看了一下提示，用递归的方法。思路很直接，count(n,c)表示长度为n，以元音字母c结尾的种类数，答案就是count(n,‘u’)了.

我发现别人用数学方法求出来了：

(n+4)*(n+3)*(n+2)*(n+1)/24

还有用动态规划的方法，后面研究一下。

代码

class Solution:
    def count(self,n,c):
        cnt=0
        arr=['a','e','i','o','u']
        if(n==1):
            return arr.index(c)+1
        for ch in arr:
            cnt+=self.count(n-1,ch)
            if ch==c:
                break
        return cnt
    def countVowelStrings(self, n: int) -> int:
        res=self.count(n,'u')
        return res