---
tags: AC LeetCode 刷題讀書會 - 2023
---

# 2023/10/01 (日) 每週 LeetCode 刷題

## 刷題題號
- [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)

## 解題思路
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 to the top?
<pre style='background-color:#ggg'>
你正在爬樓梯，需要幾步才到最上方。
每次你可以選擇爬1步或2步，你可以有幾個方式爬到最上方呢？
</pre>

## 回報格式

- 請 Fork 此 Replit 連結(https://replit.com/@AllenLi23/AC-LeetCode-Js-70-Climbing-Stairs)後，進行程式碼解題，並於完成後更新到 Replit 中，再將連結貼至「解題分享區」來與大家交流做法。

解題分享區
---

讀書會議流程：

#簽到表：
https://docs.google.com/spreadsheets/d/1gc16rrF-yZNs845z_nYrdgDIiSECOJok30dNLyQm69A/edit#gid=534323210

1. 題目說明。
2. 題目解析(BigO(n))。
4. 成員分享解題思路。
5. 問題與討論。

<!-- No.0 (請依序排序下去)
name: name (回報範例)
lighthouse: lighthouse
Replit：https://replit.com/@AllenLi23/AC-LeetCode-Js-70-Climbing-Stairs-Allen
-->

<!-- No.1
name: Jack Hung
lighthouse: [e-mail]
Replit：https://replit.com/@LungHsuanHung/AC-LeetCode-Go-70-Climbing-Stairs#solution/solution.go
-->

<!-- No.2
name: Kai
lighthouse: [e-mail]
Replit: https://replit.com/@Beginneraboutli/AC-LeetCode-Js-70-Climbing-Stairs#index.js
-->

<!-- No.3
name: Ben
lighthouse: [e-mail]
Replit: https://replit.com/@a84012807/AC-LeetCode-Js-70-Climbing-Stairs
-->