Leetcode Pascal's Triangle II

动规求Pascal三角，0ms简单动规

int* getRow(int rowIndex, int* returnSize) {    int i, j;    *returnSize = rowIndex + 1;    int* a = calloc(sizeof(int), (rowIndex + 1));    a[0] = 1;    for (i = 1 ; i <= rowIndex ; i++)        for (j = i ; j >= 1 ; j--)            a[j] += a[j-1];    return a;}