mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 18:38:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Updated parameter name

Browse Source
This commit is contained in:
ajinkyac03 2022-09-12 11:33:25 +05:30
parent 6a7f48613d
commit 3f75428c04
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
dynamic_programming/tribonacci.py
View File

@ -1,19 +1,19 @@
# Tribonacci sequence using Dynamic Programming # Tribonacci sequence using Dynamic Programming
def tribonacci(n: int) -> list: def tribonacci(num: int) -> list:
""" """
Given a number n, return first n Tribonacci Numbers. Given a number, return first n Tribonacci Numbers.
>>> tribonacci(5) >>> tribonacci(5)
[0, 0, 1, 1, 2] [0, 0, 1, 1, 2]
>>> tribonacci(8) >>> tribonacci(8)
[0, 0, 1, 1, 2, 4, 7, 13] [0, 0, 1, 1, 2, 4, 7, 13]
""" """
dp = [0 for i in range(n)] dp = [0 for i in range(num)]
dp[0] = dp[1] = 0 dp[0] = dp[1] = 0
dp[2] = 1 dp[2] = 1
for i in range(3, n): for i in range(3, num):
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3] dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3]
return dp return dp