OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update and rename Pascal_Triangle.cpp to pascal_triangle.cpp

Browse Source 
change file name and put code inside a function
This commit is contained in:
joker123 2019-11-17 15:00:37 +09:00 committed by GitHub
parent cb4722e052
commit 2cbd85914d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 38 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

65
Others/Pascal_Triangle.cpp → Others/pascal_triangle.cpp
View File

@ -2,32 +2,8 @@
using namespace std;
int main()
void show_pascal(int **arr, int n)
{
int n = 0;
cout << "Set Pascal's Triangle Height" << endl;
cin >> n;
//memory allocation (Assign two-dimensional array to store Pascal triangle)
int **arr = new int*[n];
for (int i = 0; i < n; ++i)
{
arr[i] = new int[2 * n - 1];
memset(arr[i], 0, sizeof(int)*(2 * n - 1));
}
for (int i = 0; i < n; ++i)
{
for (int j = n-i-1; j < n+i; ++j)
{
if (j == n - i - 1 || j == n + i - 1)
arr[i][j] = 1; //The edge of the Pascal triangle goes in 1
else
arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];
}
}
//pint Pascal's Triangle
for (int i = 0; i < n; ++i)
{
@ -40,13 +16,48 @@ int main()
}
cout << endl;
}
}
int **pascal_triangle(int **arr, int n)
{
for (int i = 0; i < n; ++i)
{
for (int j = n - i - 1; j < n + i; ++j)
{
if (j == n - i - 1 || j == n + i - 1)
arr[i][j] = 1; //The edge of the Pascal triangle goes in 1
else
arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];
}
}
return arr;
}
int main()
{
int n = 0;
cout << "Set Pascal's Triangle Height" << endl;
cin >> n;
//memory allocation (Assign two-dimensional array to store Pascal triangle)
int **arr = new int*[n];
for (int i = 0; i < n; ++i)
{
arr[i] = new int[2 * n - 1];
memset(arr[i], 0, sizeof(int)*(2 * n - 1));
}
pascal_triangle(arr, n);
show_pascal(arr, n);
//deallocation
for (int i = 0; i < n; ++i)
{
delete[] arr[i];
}
delete [] arr;
delete[] arr;
return 0;
}
}