挑战数据结构和算法——跳台阶问题

int get_kind(int n){
    if (n <= 0) return 0;

    int result;
    int *cal = (int *)malloc(sizeof(int) * n);
    for (int i = 0; i < n; i++){
        if ((i + 1) == 1) cal[i] = 1;
        else if ((i + 1) == 2) cal[i] = 2;
        else {
            cal[i] = cal[i-1] + cal[i-2];
        }
    }
    result = cal[n-1];
    free(cal);
    return result;
}