AlgoDesign

Triple step

1class Solution:
2    def tripleStep(self, n):
3        dp = [1, 2, 4]
4        
5        for i in range(4, n + 1):
6            print(dp[2])
7            tmp3, tmp2 = dp[2], dp[1]
8            dp[2] += dp[0] + dp[1]
9            dp[0] = tmp2
10            dp[1] = tmp3
11        
12        return dp[2]
13
14sol = Solution()
15print(sol.tripleStep(5))