Pascal's Triangle - Java Pt. 1

Chris Chen
import java.util.*;

public class PascalTriangleDubs {

//Where the triangle is created and displayed
public static void main(String[] args){

Scanner in = new Scanner(System.in);

System.out.print("Enter the number of rows you want displayed from Pascal's Triangle: ");
int numRows = in.nextInt(); //stores number of rows user wants displayed

displayTriangle(pascalTriangle(numRows));

} //end main

public static int[][] pascalTriangle(int n){

int[][] triangle = new int[n][]; //creates a matrix to store the triangle

for(int i = 0; i < n; i++){

triangle[i] = new int[i+1];

for(int j = 0; j < triangle[i].length; j++){

triangle[i][j] = choose(i, j);

}

}

return(triangle);
}

public static int choose(int n, int k){
return(factorial(n))/(factorial(k)*factorial(n-k));
}

public static int factorial(int num){
int var = 1;
if(num == 0)
return(1);

for(int i = 1; i var *= i;

return(var);
}

public static void displayTriangle(int[][] triangle){
for(int i = 0; i < triangle.length; i++){

for(int j = 0; j < triangle[i].length; j++){

System.out.print(triangle[i][j] + "\t");

}

System.out.println();

}
}
}

Published by Chris Chen

Chris is currently attending the University of California, Berkeley seeking an undergraduate's degree in Electrical Engineering Computer Science. He enjoys playing basketball, practicing kendo, hanging out w...  View profile

To comment, please sign in to your Yahoo! account, or sign up for a new account.