数据结构与算法

算法设计

【绪论1.17】已知k阶斐波那契序列的定义为
f0=0, f1=0, …, fk-2=0, fk-1=1;
fn=fn-1+fn-2+…+fn-k, n=k,k+1,…
例如:
k=3; 0,0,1,1,2,4,7,13

试编写求k阶斐波那契序列的第m项值的函数算法，k和m均以值调用的形式在函数参数表中出现。

（1）C++实现

#include<iostream>
#include<vector>
using namespace std;

int Fabnacci(int k, int m) {
    int sum = 0;
    vector<int> vec;
    if (k <= 0 || m <= 0) {
        return -1;
    }
    else if (m < k) {
        return 0;
    }
    else {
        for (int i = 0; i < k-1; i++)
            vec.push_back(0);
        vec.push_back(1);
        int index = 0;
        for (int i = k; i <= m; i++) {
            sum = 0;
            index = k;
            for (int j = vec.size() - 1; index > 0; j--) {
                sum += vec[j];
                index--;
            }
            vec.push_back(sum);
        }
    }
    for (int i = 0; i < vec.size(); i++) {
        cout << vec[i] << endl;
    }
    cout << endl;
    return vec[vec.size() - 1];
}

int main() {
    int m, k;
    cin >> k >> m;
    cout << Fabnacci(k, m);
    cin >> k;
    return 0;
}

（2）C语言实现

//C语言的做法就是自己创建了一个大小为k的一维数组来保存前k项，感觉上做法不是很好
#include<stdio.h>
#include<malloc.h>

int Fabnacci(int k, int m) {
    if (m < k - 1) {
        return 0;
    } if (m == k - 1) {
        return 1;
    }
    else {
        int temp = 0;
        int* arr = (int*)malloc(sizeof(int) * k);
        for (int i = 0; i < k - 1; i++)
            arr[i] = 0;
        arr[k - 1] = 1;
        for (int i = k; i <= m; i++) {
            temp = 0;
            for (int i = 0; i < k; i++) {
                temp += arr[i];
            }
            for (int i = 0; i < k-1; i++) {
                arr[i] = arr[i + 1];
            }
            arr[k - 1] = temp;
        }
        temp = arr[k - 1];
        free(arr);
        return temp;
    }

}

int main() {
    int k, m;
    scanf_s("%d %d", &k, &m);
    int output = Fabnacci(k, m);
    printf("%d", output);
    return 0;
}