leetcode 118 杨辉三角 c# 二维数组

static void Main(string[] args)  
{  
    int lisu = 5;  
    int[][] a = GetJiaoni(lisu);  
    for (int i = 0; i < a.Length; i++) //遍历数组输出杨辉三角形  
    {   
        for (int j = 0; j < a[i].Length; j++)  
            Console.Write("{0}\t", a[i][j]);  
        Console.Write("\n");  
    }  
    Console.Read();  
    Console.ReadKey();  
}  
public static int[][] GetJiaoni(int length)  
{   
    int[][] a = new int[length][];//二维数组  
  
  
    for (int i = 0; i < a.Length; i++)  
        a[i] = new int[i + 1];//遍历，赋值增量  
    for (int j = 0; j < a.Length; j++)  
    {  
        a[j][0] = 1; //把第1列的元素都赋1  
        a[j][j] = 1; //把每1列最右边的元素都赋1  
        for (int m = 1; m < a[j].Length - 1; m++)  
            a[j][m] = a[j - 1][m - 1] + a[j - 1][m];//其余元素的值由杨辉公式计算  
    }  
    return a;  
}