files renamed to standard - without spaces and made CPPLINT compatible

This commit is contained in:
Krishna Vedala
2020-05-25 23:13:26 -04:00
parent 4e8a2f7151
commit 120fe06fcb
14 changed files with 211 additions and 124 deletions

View File

@@ -1,63 +1,53 @@
#include<iostream>
#include <cstring>
#include <iostream>
using namespace std;
void show_pascal(int **arr, int n)
{
//pint Pascal's Triangle
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n + i; ++j)
{
if (arr[i][j] == 0)
cout << " ";
else
cout << arr[i][j];
}
cout << endl;
}
void show_pascal(int **arr, int n) {
// pint Pascal's Triangle
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n + i; ++j) {
if (arr[i][j] == 0)
std::cout << " ";
else
std::cout << arr[i][j];
}
std::cout << std::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];
}
}
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;
return arr;
}
int main()
{
int n = 0;
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);
std::cout << "Set Pascal's Triangle Height" << std::endl;
std::cin >> n;
//deallocation
for (int i = 0; i < n; ++i)
{
delete[] arr[i];
}
delete[] arr;
// 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));
}
return 0;
pascal_triangle(arr, n);
show_pascal(arr, n);
// deallocation
for (int i = 0; i < n; ++i) {
delete[] arr[i];
}
delete[] arr;
return 0;
}