C#1.30 面试题/杨辉三角/矩阵转置/

1.30

《面》1.杨辉三角

    //杨辉三角

            int lines = 5;

            int[,] numArr = new int[lines, lines];

            for (int i = 0; i < numArr.GetLength(0);i++)

            {

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

                {

                    //numArr[i, j] = j == 0 || i == j ? 1 :numArr[i - 1, j] + numArr[i - 1, j - 1];