# 65. 使用最小花费爬楼梯

java

```java
package leetcode.all.solution701_800;

/**
 * 746. 使用最小花费爬楼梯
 *
 * 数组的每个索引做为一个阶梯，第 i个阶梯对应着一个非负数的体力花费值 cost[i](索引从0开始)。
 *
 * 每当你爬上一个阶梯你都要花费对应的体力花费值，然后你可以选择继续爬一个阶梯或者爬两个阶梯。
 *
 * 您需要找到达到楼层顶部的最低花费。在开始时，你可以选择从索引为 0 或 1 的元素作为初始阶梯。
 *
 * 示例 1:
 *
 * 输入: cost = [10, 15, 20]
 * 输出: 15
 * 解释: 最低花费是从cost[1]开始，然后走两步即可到阶梯顶，一共花费15。
 *  示例 2:
 *
 * 输入: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
 * 输出: 6
 * 解释: 最低花费方式是从cost[0]开始，逐个经过那些1，跳过cost[3]，一共花费6。
 * 注意：
 *
 * cost 的长度将会在 [2, 1000]。
 * 每一个 cost[i] 将会是一个Integer类型，范围为 [0, 999]。
 *
 * @author 刘壮飞
 * https://github.com/zfman.
 * https://blog.csdn.net/lzhuangfei.
 */
public class Solution746 {
    public int minCostClimbingStairs(int[] cost) {
        int[] v=new int[cost.length+1];
        if(cost.length==0) return 0;
        if(cost.length==1) return 1;
        if(cost.length==2) return Math.min(cost[0],cost[1]);

        v[0]=cost[0];
        v[1]=cost[1];

        for(int i=2;i<cost.length+1;i++){
            if(i==cost.length) v[i]=Math.min(v[i-2],v[i-1]);
            else v[i]=Math.min(v[i-2],v[i-1])+cost[i];
        }

        return v[cost.length];
    }

    public static void main(String[] args) {
        int[] cost = {
                1, 100, 1, 1, 1, 100, 1, 1, 100, 1
        };
        int r = new Solution746().minCostClimbingStairs(cost);
        System.out.println(r);
    }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/zhi-shang-lei/65-shi-yong-zui-xiao-hua-fei-pa-lou.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.