https://shio-chan-dev.github.io/jeanblog/tags/leetcode-70/Recent content in LeetCode 70 on Jeanphilo BlogHugo -- 0.161.1en-usSun, 03 May 2026 14:33:39 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/70-climbing-stairs/Sun, 03 May 2026 14:33:39 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/70-climbing-stairs/<h2 id="problem">Problem</h2> <h3 id="input-and-output">Input and Output</h3> <ul> <li>Input: an integer <code>n</code></li> <li>Meaning: climb to the top of the <code>n</code>-step staircase</li> <li>Each move can climb <code>1</code> or <code>2</code> steps</li> <li>Output: return the number of distinct ways to reach the top</li> <li>Constraints: <code>1 &lt;= n &lt;= 45</code></li> </ul> <h3 id="examples">Examples</h3> <div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"><code class="language-text" data-lang="text"><span style="display:flex;"><span>Input: n = 2 </span></span><span style="display:flex;"><span>Output: 2 </span></span><span style="display:flex;"><span>Explanation: 1+1, 2 </span></span></code></pre></div><div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"><code class="language-text" data-lang="text"><span style="display:flex;"><span>Input: n = 3 </span></span><span style="display:flex;"><span>Output: 3 </span></span><span style="display:flex;"><span>Explanation: 1+1+1, 1+2, 2+1 </span></span></code></pre></div><p>This article uses Python only and derives the final solution step by step from the meaning of <code>dp[i]</code>.</p>