杨辉三角形(C#)

        /// <summary>
        /// 杨辉三角形
        /// </summary>
        public void YangHui()
        {
            const int N = 10;
            int[][] pacs = new int[N][];
            for (int i = 0; i < N; i++)
            {
                pacs[i] = new int[i + 1];
            }
            pacs[0][0] = 1;
            for (int i = 1; i < N; i++)// !< 外循环改成1
            {
                pacs[i][0] = 1;
                pacs[i][i] = 1;
                for (int j = 1; j < i; j++) // !< 内循环计算
                {
                    pacs[i][j] = pacs[i - 1][j - 1] + pacs[i - 1][j];
                }
            }
            for (int i = 0; i < N; i++) // !< 遍历杨辉三角形
            {
                for (int j = 0; j <= i; j++)
                {
                    Console.Write("{0,4}", pacs[i][j]);

                }
                Console.WriteLine();
            }
        }

运行结果