我有一个pascal三角形,最大行数为5。让我们假设我想找到第四行的积分。如何访问帕斯卡三角形的第四行。 More precisely I want to know how to access a row in the pascal's triangle by entering the number n of the row
代码
#include <iostream>
using namespace std;
int main(){
int a1, a2, a3, a4, a5, pascal, columns;
const int rows = 5;
int **array = new int *[rows]; //generating array
for(int i = 0; i <= rows; i++)
array[i] = new int [columns];
for (int i = 0; i <= rows; i++){ //loop for te pascal's triangle
for (int j = 0; j <= i; j++){
if(j == 0 || i == 0){
pascal = 1; //first element of pascal's triangle
}
else{
pascal = pascal *(i - j + 1) / j; //pascal's triangle formula
}
cout << " " << pascal; // printing pascals triangle
}
cout << "\n";
}
cout << "enter which row to integrate: ";
// here I want to directly access a row rather that entering the elements of the row
cin >> a1;
cin >> a2;
cin >> a3;
cin >> a4;
cin >> a5;
}
1
1 1
1 2 1
1 3 3 1 ------>与n = 4
类似,我想集成此行的元素
1 4 6 4 1
答案应该是
for 1,3,3,1 = 0, 1, 1.5, 1, 0.25
答案 0 :(得分:0)
您应该先用元素填充数组,然后才能这样访问它们(编辑:确保初始化columns变量,我将其设置为5)
#include <iostream>
using namespace std;
int main() {
int row_nb, pascal, columns = 5; //Initialized columns with columns = 5
const int rows = 5;
int **array = new int *[rows]; //generating array
for (int i = 0; i <= rows; i++)
array[i] = new int[columns];
for (int i = 0; i <= rows; i++) { //loop for te pascal's triangle
for (int j = 0; j <= i; j++) {
if (j == 0 || i == 0) {
pascal = 1; //first element of pascal's triangle
}
else {
pascal = pascal *(i - j + 1) / j; //pascal's triangle formula
}
array[i][j] = pascal; //fill the array
cout << " " << pascal; // printing pascals triangle
}
cout << "\n";
}
cout << "enter which row to intergrate: ";
// here I want to directly access a row rather that entering the elements of the row
cin >> row_nb; //input the row you want to access
for (int i = 0; i <= row_nb; i++) { //access the elements in this row in the array
cout << array[row_nb][i] << " ";
}
return 0; // add the return statement since the return type of the main function is int
}
答案 1 :(得分:-1)
正如我所说的when you last asked this:
您可以在计算时将每行简单地存储到std::vector<int>
中(作为打印的补充或替代方法),然后在{{ 1}}。然后,要在计算三角形后访问第n行,只需获取第二个向量的第std::vector<std::vector<int>>
个元素。