1220. Count Vowels Permutation
Read the full problem statement on LeetCode.
Difficulty: hard Acceptance: 62% Topics: Dynamic Programming
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(logn)
# Space: O(1)
import itertools
class Solution(object):
def countVowelPermutation(self, n):
"""
:type n: int
:rtype: int
"""
def matrix_expo(A, K):
result = [[int(i==j) for j in xrange(len(A))] \
for i in xrange(len(A))]
while K:
if K % 2:
result = matrix_mult(result, A)
A = matrix_mult(A, A)
K /= 2
return result
def matrix_mult(A, B):
ZB = zip(*B)
return [[sum(a*b for a, b in itertools.izip(row, col)) % MOD \
for col in ZB] for row in A]
MOD = 10**9 + 7
T = [[0, 1, 1, 0, 1],
[1, 0, 1, 0, 0],
[0, 1, 0, 1, 0],
[0, 0, 1, 0, 0],
[0, 0, 1, 1, 0]]
return sum(map(sum, matrix_expo(T, n-1))) % MOD
# Time: O(n)
# Space: O(1)
class Solution2(object):
def countVowelPermutation(self, n):
"""
:type n: int
:rtype: int
"""
MOD = 10**9 + 7
a, e, i, o, u = 1, 1, 1, 1, 1
for _ in xrange(1, n):
a, e, i, o, u = (e+i+u) % MOD, (a+i) % MOD, (e+o) % MOD, i, (i+o) % MOD
return (a+e+i+o+u) % MOD
Solution from kamyu104/LeetCode-Solutions · MIT
Similar questions