[C语言][LeetCode][119]Pascal's Triangle II

题目

Pascal’s Triangle II
Given an index k, return the kth row of the Pascal’s triangle.

For example, given k = 3,
Return [1,3,3,1].

标签

Array

难度

简单

分析

题目意思是给定一个index，返回第index个的杨辉三角行。解题思路其实跟下面这个差不多，就是在最后返回这道题目的要求即可。
http://blog.csdn.net/timsley/article/details/51264605

C代码实现

int* getRow(int rowIndex, int* returnSize) 
{
    int i=0, j=0;    

    int ** returnArray = (int **)malloc(sizeof(int *) * (rowIndex+1));

    for(i=0; i<rowIndex+1; i++)
    {
        returnArray[i] = (int *)malloc(sizeof(int) * (i+1));

        for(j=0; j<i+1; j++)
        {
            if( (0 == j)  || (i == j) )
                returnArray[i][j] = 1;
            else
                returnArray[i][j] = returnArray[i-1][j-1] + returnArray[i-1][j];
        }        
    }

    *returnSize = rowIndex + 1;
    return returnArray[rowIndex];    
}