摘要: 理论基础 斐波那契数 class Solution: def fib(self, n: int) -> int: if n == 0: return 0 if n == 1: return 1 return self.fib(n-1)+self.fib(n-2) 爬楼梯 class Solution 阅读全文
posted @ 2024-04-28 18:12 MiraMira 阅读(15) 评论(0) 推荐(0)