leetcode746

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        vector<int> totol(cost.size(), );
        totol[] = cost[], totol[] = cost[];
        for (int i = ; i < cost.size(); i++) {
            totol[i] = min(totol[i - ] + cost[i], totol[i - ] +cost[i]);
        }
        return min(totol[cost.size() - ], totol[cost.size() - ]);
    }
};

下面是C#版本的：

public class Solution
    {
        public int MinCostClimbingStairs(int[] cost)
        {
            var total = new List<int>();
            total.Add(cost[]);//第0阶台阶的最小总花费
            total.Add(Math.Min(cost[], cost[] + cost[]));//第1节台阶的最小总花费

            for (int i = ; i < cost.Length; i++)
            {
                //当前台阶的最小总花费=当前台阶的直接花费+ min(当前-1节总花费 , 当前-2节总花费)
                total.Add(cost[i] + Math.Min(total[i - ], total[i - ]));
            }
            //最后上到楼梯顶，可能踩倒数第一节或者倒数第二节。选择其中小的
            return Math.Min(total[cost.Length - ], total[cost.Length - ]);
        }
    }