# 遞精喔 # 70. Climbing Stairs 1. 一般遞迴 利用類似序列排序法,但容易超時  結果為TLE 2.遞迴記憶 在陣列範圍裏設定避免重複計算  結果為AC 3.for迴圈 比較簡易的[](https://)方式,不但清晰又不會超時   結果為AC
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up