C++程序在斐波那契数列中查找最接近的数字

#include <iostream>
using namespace std;

// 生成斐波那契数列
void generateFibonacci(int n, int* fib)
{
    fib[0] = 0;
    fib[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        fib[i] = fib[i - 1] + fib[i - 2];
    }
}

// 在斐波那契数列中查找最接近的数字
int findClosestNumber(int target, int* fib, int n)
{
    int minDiff = abs(target - fib[0]);
    int closestNumber = fib[0];

    for (int i = 1; i <= n; i++)
    {
        int diff = abs(target - fib[i]);
        if (diff < minDiff)
        {
            minDiff = diff;
            closestNumber = fib[i];
        }
    }

    return closestNumber;
}

int main()
{
    int n = 20; // 斐波那契数列的长度
    int target = 100; // 目标数字

    int* fib = new int[n + 1];
    generateFibonacci(n, fib);

    int closestNumber = findClosestNumber(target, fib, n);
    cout << "The closest number in the Fibonacci sequence to " << target << " is: " << closestNumber << endl;

    delete[] fib;
    return 0;
}