[Swift]LeetCode746. 使用最小花费爬楼梯 | Min Cost Climbing Stairs

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10525485.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).

Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.

Example 1:

Input: cost = [10, 15, 20]
Output: 15
Explanation: Cheapest is start on cost[1], pay that cost and go to the top. 

Example 2:

Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
Output: 6
Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3]. 

Note:

1. cost will have a length in the range [2, 1000].
2. Every cost[i] will be an integer in the range [0, 999].

---

数组的每个索引做为一个阶梯，第 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。

注意：

1. cost 的长度将会在 [2, 1000]。
2. 每一个 cost[i] 将会是一个Integer类型，范围为 [0, 999]。

---

Runtime: 32 ms

Memory Usage: 18.9 MB

class Solution {
    func minCostClimbingStairs(_ cost: [Int]) -> Int {
        var f: [Int] = []
        f.append(cost[0])
        for i in 1...(cost.count + 1) {
            var one = f[i - 1]
            var two = 0
            var now = 0
            if i - 2 < 0 {
                two = 0
            } else {
                two = f[i - 2]
            }
            if i >= cost.count {
                now = 0
            } else {
                now = cost[i]
            }
            f.append(min(one + now, two + now))
        }
        return min(f[cost.count], f[cost.count + 1])
    }
}

---

32ms

class Solution {
    func minCostClimbingStairs(_ cost: [Int]) -> Int {
        if cost.count == 1 {
            return cost[0]
        }
        if cost.count == 2 {
            return min(cost[0], cost[1])
        }
        
        var result = Array(repeating: 0, count: cost.count+1)
        result[0] = 0
        result[1] = 0
        for i in 2...cost.count {
            result[i] = min(result[i-2] + cost[i-2], result[i-1] + cost[i-1])
        }
        return result[cost.count]
    }
}

---

36ms

class Solution {
    
    func minCostClimbingStairs(_ cost: [Int]) -> Int {
        var result1 = cost[0]
        var result2 = cost[1]
        
        for i in 2 ..< cost.count {
            var base = min(result1, result2)
            result1 = result2
            result2 = cost[i] + base
        }
        
        return min(result1, result2)        
    }
}

---

40ms

class Solution {
    func minCostClimbingStairs(_ cost: [Int]) -> Int {
        var step1 = 0, step2 = 0
        for i in cost.indices.dropFirst(2) {
            let step3 = min(step1 + cost[i - 2], step2 + cost[i - 1])
            step1 = step2
            step2 = step3
        }
        return min(step1 + cost.dropLast().last!, step2 + cost.last!)
    }
}

---

48ms

class Solution {
    func minCostClimbingStairs(_ cost: [Int]) -> Int {
        var minCost = cost
        for i in 2 ..< cost.count{
            minCost[i] += min(minCost[i-1], minCost[i-2])
        }
        
        return min(minCost[cost.count-1], minCost[cost.count-2])
    }
}

---

64ms

class Solution {
    func minCostClimbingStairs(_ cost: [Int]) -> Int {
        let n = cost.count
        var value1 = cost[0]
        var value2 = cost[1]
        for i in 2..<n {
            (value2, value1) = (min(value2, value1) + cost[i], value2)
        }
        return min(value1, value2)
    }
}