PascalFast

public class PascalFast {

    //prints out triangle faster
    public void printPascal (int n)
    {
        //2D array for triangle, n+1 beacuse we start at level 0
        long[][] triangle = new long[n+1][n+1];

        triangle[0][0] = 1;
        System.out.println(triangle[0][0]);

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

            triangle[i][0] = 1;
            System.out.print(triangle[i][0] + " ");

            for (int j = 1; j <= i; j++) {

                triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];

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

            }
            System.out.println();

        }


    }

}