ARTS-005

Algorithm

---

746. Min Cost Climbing Stairs

class Solution {
    public int minCostClimbingStairs(int[] cost) {
        /*** 记录的并不一定是最终结果 **/
        /*** f1,f0 ：记录跳到当前台阶需要的消耗，包含当前台阶 **/
        int f0 = cost[0];
        int f1 = cost[1];
        for (int i = 2; i < cost.length; ++i) {
             int tmp = cost[i] + Math.min(f0, f1);
             f0 = f1;
             f1 = tmp;
        }
        /*** 判断从哪个台阶上来消耗更少 **/
        return Math.min(f0, f1);
    }
}

Review

---

Tip

---

B+树为何作为索引存储结构

Share

---