Stairs

1 题目 An n-bit gray code sequence is a sequence of 2n integers where: Every integer is in the inclusive range [0, 2n - 1], The first integer is 0, An i ......

1 题目 假设你正在爬楼梯，需要n步你才能到达顶部。但每次你只能爬一步或者两步，爬到顶部的方法有多少种？ 样例 1： 输入： n = 3 输出： 3 解释：共3种 1, 1, 1 1, 2 2, 1 样例 2： 输入： n = 1 输出： 1 解释：只有一种方案 2 解答 错误的想法： class ......

# Content You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can ......

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb ......