C++ 动态分配内存计算斐波那契数列前 15 项

#include using namespace std;

int main() { int* fibonacci = new int[15]; fibonacci[0] = 0; fibonacci[1] = 1;

for (int i = 2; i < 15; i++) {
    fibonacci[i] = fibonacci[i-1] + fibonacci[i-2];
}

for (int i = 0; i < 15; i++) {
    cout << setw(8) << fibonacci[i];
    if ((i+1) % 5 == 0) {
        cout << '\n';
    }
}

delete[] fibonacci;
return 0;

}