2021-01-25 1641. Count Sorted Vowel Strings

1641. Count Sorted Vowel Strings

Difficulty: Medium

Related Topics: Math, Dynamic Programming, Backtracking

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

Solution

Language: Java

Keys: in dynamic programming, we need to construct a dp table, and in a dp table, more often than not, one point is related to the two points at its two corners.

class Solution {
    public int countVowelStrings(int n) {
        int[][] result = new int[n + 1][6];
        
        for (int i = 1; i < 6; i++) {
            result[1][i] = i;
        }
        
        for (int i = 2; i <= n; i++) {
            result[i][1] = 1;
            for (int vo = 1; vo < 6; vo++) {
                result[i][vo] = result[i - 1][vo] + result[i][vo - 1];
            }
        }
        
        return result[n][5];
    }
}