Python刷leetcode--剑指 Offer 10- II.青蛙跳台阶问题

思路：先递归，再优化递归。

拖慢递归的原因是重复的底层计算。所以计算过一次就存起来。每次计算就判断是不是已经计算过了

当然也可以往斐波那契数列上想，因为形式都跟它一摸一样，应该也可以迭代着写。

class Solution:
    def __init__(self):
        self.val = {}
        self.count = 0

    def numWays(self, n: int) -> int:
        # leetcode submit region end(Prohibit modification and deletion)
        return self.rec(n) % 1000000007

    def rec(self, n):
        if n == 1 or n == 0:
            return 1
        if n - 1 in self.val:
            a = self.val.get(n - 1)
        else:
            self.count += 1
            a = self.rec(n - 1)
            self.val[n - 1] = a
        if n - 2 in self.val:
            b = self.val.get(n - 2)
        else:
            self.count += 1
            b = self.rec(n - 2)
            self.val[n - 2] = b
        return a + b


if __name__ == '__main__':
    sol = Solution()
    print(sol.numWays(7))
    print(sol.count)