forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
n-th-tribonacci-number.py
45 lines (38 loc) · 1.02 KB
/
n-th-tribonacci-number.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
# Time: O(logn)
# Space: O(1)
import itertools
class Solution(object):
def tribonacci(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)) \
for col in ZB] for row in A]
T = [[1, 1, 1],
[1, 0, 0],
[0, 1, 0]]
return matrix_expo(T, n)[1][0]
# Time: O(n)
# Space: O(1)
class Solution2(object):
def tribonacci(self, n):
"""
:type n: int
:rtype: int
"""
a, b, c = 0, 1, 1
for _ in xrange(n):
a, b, c = b, c, a+b+c
return a