// Mine
class Solution {
public:
int minCostClimbingStairs(vector<int>& C) {
int n = C.size();
int f[n];
f[0] = C[0];
f[1] = C[1];
for (int i = 2; i < n; i++) {
f[i] = min(f[i - 1], f[i - 2]) + C[i];
}
return min(f[n - 1], f[n - 2]);
}
};