Python 实现：青蛙跳台阶问题的递归求解法

```python def frog_jump(n): if n == 1: return 1 elif n == 2: return 2 else: return frog_jump(n-1) + frog_jump(n-2) n = int(input("请输入台阶数：")) print("青蛙跳上台阶的方法数为：", frog_jump(n)) ``` ######[AI写代码神器 | 102点数解答 | 2024-06-14 10:07:47]