algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-21 11:10:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
src/main/java/com/thealgorithms/maths/PascalTriangle.java
View File

@ -1,5 +1,7 @@
package com.thealgorithms.maths;
public class PascalTriangle {
/**
*In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises
* in probability theory, combinatorics, and algebra. In much of the Western world, it is named after
@ -31,8 +33,7 @@ public class PascalTriangle {
*
*/
public static int[][] pascal(int n)
{
public static int[][] pascal(int n) {
/**
* @param arr An auxiliary array to store generated pascal triangle values
* @return
@ -42,22 +43,18 @@ public class PascalTriangle {
* @param line Iterate through every line and print integer(s) in it
* @param i Represents the column number of the element we are currently on
*/
for (int line = 0; line < n; line++)
{
for (int line = 0; line < n; line++) {
/**
* @Every line has number of integers equal to line number
*/
for (int i = 0; i <= line; i++)
{
for (int i = 0; i <= line; i++) {
// First and last values in every row are 1
if (line == i || i == 0)
arr[line][i] = 1;
// The rest elements are sum of values just above and left of above
else
arr[line][i] = arr[line-1][i-1] + arr[line-1][i];
if (line == i || i == 0) arr[line][i] = 1;
// The rest elements are sum of values just above and left of above
else arr[line][i] = arr[line - 1][i - 1] + arr[line - 1][i];
}
}
return arr;
}
}