LeetCode118杨辉三角-C语言、python

给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。

在杨辉三角中，每个数是它左上方和右上方的数的和。

示例:

输入: 5
输出:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

C语言版：

/**
 * Return an array of arrays.
 * The sizes of the arrays are returned as *columnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
int** generate(int numRows, int** columnSizes) {
    int i, j;
    if(numRows == 0) return 0;
    
    int** Array = (int **)malloc(numRows * sizeof(int *)); //定义二维数组的指针
    *columnSizes = (int *)malloc(numRows * sizeof(int));  //定义表示每一行大小的指针
    for(i = 0; i < numRows; i++){
        (*columnSizes)[i] = i + 1;
        Array[i] = (int *)malloc((i + 1) * sizeof(int));
        for(j = 0; j < i + 1; j++){
            if((j == 0) || (j == i))
                Array[i][j] = 1;
            else
                Array[i][j] = Array[i - 1][j - 1] + Array[i - 1][j];
        }
    }
    return Array;
}

Python版：

class Solution:
    def generate(self, numRows):
        """
        :type numRows: int
        :rtype: List[List[int]]
        """
        result = []
        if numRows == 0: return []
        for i in range(numRows):
            temp = []
            for j in range(i + 1):
                if j == 0: 
                    temp.append(1)
                elif j == i:
                    temp.append(1)
                else:
                    add = result[i - 1][j - 1] + result[i - 1][j]
                    temp.append(add)
            result.append(temp)
        return result