using System;

using System.Collections.Generic;

/*Given numRows, generate the first numRows of Pascal’s triangle.

​

Pascal’s triangle : To generate A[C] in row R, sum up A’[C] and A’[C-1] from previous row R - 1.

​

Example:

​

Given numRows = 5,

​

Return

​

[

     [1],

     [1,1],

     [1,2,1],

     [1,3,3,1],

     [1,4,6,4,1]

]*/

​

public class Program

{

    public static void Main()

    {

        int[][] result = GenerateTriangle(5);

        for(int i = 0; i < result.Length; i++)

        {

            for(int j = 0; j <  result[i].Length; j++)

            {

                Console.Write(result[i][j] + " ");

            }

            Console.WriteLine();

        }

    }

    public static int[][] GenerateTriangle(int numRows)

    {

        int[][] arr = new int[numRows][];

        // Iterate through every line 

        // and print integer(s) in it 

        for (int i = 0; i < numRows; i++) 

        { 

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

            // Every line has number of  

            // integers equal to line number 

            for (int j = 0; j <= i; j++) 

            {       

                // First and last values  

                // in every row are 1 

                if (i == j || j == 0) 

                    arr[i][j] = 1; 

                else 

                {

                    // Other values are sum of values 

                    // just above and left of above 

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

                }

            } 

        } 

        return arr;

    }

​

}