12. Pascal Triangle

2. Pascal Triangle
The triangle may be constructed in the following manner: In row 0 (the topmost row), there is a unique nonzero entry 1. Each entry of each subsequent row is constructed by adding the number above and to the left with the number above and to the right, treating blank entries as 0. For example, the initial number in the first (or any other) row is 1 (the sum of 0 and 1), whereas the numbers 1 and 3 in the third row are added to produce the number 4 in the fourth row.

Print each row elements separated with whitespace.

using System;
using System.Linq;

namespace _02PascalTriangle
{
    class Program
    {
        static void Main(string[] args)
        {
            int numberOfRows = int.Parse(Console.ReadLine());

            int firstRow = 1;
            Console.WriteLine(firstRow);

            if (numberOfRows == 1)
            {
                return;
            }
            int[] previousRow = new int[] {1, 1};
            Console.WriteLine(string.Join(" ", previousRow));

            if (numberOfRows == 2)
            {
                return;
            }
            else
            {
                for (int i = 0; i < previousRow.Length + 1; i++)
                {
                    int[] nextRow = new int[previousRow.Length + 1];
                    nextRow[0] = 1;
                    nextRow[nextRow.Length - 1] = 1;

                    for (int j = 1; j < nextRow.Length - 1; j++)
                    {
                        nextRow[j] = previousRow[j - 1] + previousRow[j];
                    }
                    Console.WriteLine(string.Join(" ", nextRow));

                    previousRow = nextRow;

                    if (previousRow.Length == numberOfRows)
                    {
                        break;
                    }
                }
            }
        }
    }
}
/*namespace SandBox            Друго решение с "Назъбен" масив!
{                                /
    using System;                //
                                 ///
    public class EntryPoint      ////
    {                            /////
        public static void Main()//////
        {                        ///////
                                 ////////
            long triangleRows = long.Parse(Console.ReadLine());

            long[][] jaggedArray = new long[triangleRows][];

            jaggedArray[0] = new long[1];
            jaggedArray[0][0] = 1;


            for (long row = 1; row < jaggedArray.Length; row++)
            {
                jaggedArray[row] = new long[row + 1];
                jaggedArray[row][0] = 1;
                jaggedArray[row][jaggedArray[row].Length - 1] = 1;

                for (long col = 1; col < jaggedArray[row].Length - 1; col++)
                {
                    long leftDiagonal = jaggedArray[row - 1][col - 1];
                    long rightDiagonal = jaggedArray[row - 1][col];

                    jaggedArray[row][col] = leftDiagonal + rightDiagonal;
                }
            }

            for (long row = 0; row < triangleRows; row++)
            {
                Console.WriteLine(string.Join(" ", jaggedArray[row]));
            }
        }
    }
}*/