Categorygithub.com/blueBlue0102/LeetCode-Goleetcode0746.Min-Cost-Climbing-Stairs
package
0.0.0-20241125063422-a7e1e0bf04b0
Repository: https://github.com/blueblue0102/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

746. Min Cost Climbing Stairs

https://leetcode.com/problems/min-cost-climbing-stairs/

要找 minimum cost，且每次的選擇之間擁有因果關係，是 DP 題目
先思考 base case 為何，然後就可以推導出最終的樣式

dp2 dp3 dpn

Takeaway

  • Dynamic Programming