[LeetCode] Min Cost Climbing Stairs 爬楼梯的最小损失

1. 爬楼梯的最小花费

2. dp的数组等于楼梯数+1；返回最后一个即可。
   #include
   #include
   using namespace std;
   int minT(int a,int b)
   {
   if (a > b)
   {
   return b;
   }
   return a;
   }
   int MinCostClimbingStairs(vector vec)
   {
   int n = vec.size();
   vector cost(n+1, 0);

   for (int i = 2; i < n+1; i++)
   {
   cost[i] = minT(cost[i - 1] + vec[i - 1], cost[i - 2]+vec[i - 2]);
   }
   return cost.back();;
   }
   int main()
   {
   cout << MinCostClimbingStairs({1,100,1,1,1,100,1,1,100,1}) << endl;
   system(“pause”);
   return 0;
   }