https://leetcode.com/problems/min-cost-climbing-stairs/
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
if (cost.size()<3)
return 0;
int a=cost[0], b=cost[1],temp=0;
for (int i=2; i<cost.size(); i++)
{
if (a<b)
{
temp = a+ cost[i];
a=b;
b=temp;
}
else
{
temp = b+ cost[i];
a=b;
b=temp;
}
}
if (a<b)
return a;
else
return b;
}
};