题解 | #最小花费爬楼梯#

#include <stdio.h>


int min(int a, int b) {
  return (a > b) ? b : a;
}

int max(int a, int b) {
  return (a > b) ? a : b;
}

int main() {
  // n -- int
  // cost  -- int cost[100000]
  int n = 0;
  int cost[100000] = {0};
  scanf("%d", &n);
  for (int i = 0; i < n; i ++) {
    scanf("%d", &cost[i]);
  }

  int allCost[100000] = {0};
  allCost[0] = 0;
  allCost[1] = 0;
  for (int i = 2; i <= n; i ++) { --注意这里的小于等于
    allCost[i] = min(allCost[i-2] + cost[i-2], allCost[i-1] + cost[i-1]) ;
  }




  printf("%d ", allCost[n]);
  return 0;
}