leetcode119.Pascal'sTriangleII

Given an index k, return the kth row of the Pascal's triangle.

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

Note:
Could you optimize your algorithm to use only O(k) extra space?

第一种方法就是直接进行计算：//A[i]=A[i-1]+A[i]      0<i<n-1    A[0]=1. A[n-1]=1

代码如下：

class Solution 
{
public:
    vector<int> getRow(int rowIndex)
    {
        vector<int> ret;
        if(rowIndex<0)
        {
            return ret;
        }
        ret.resize(rowIndex+1,0);
        ret[0]=1;
        for(int k=1;k<rowIndex+1;k++)
        {
            for(int j=k;j>0;j--)
            {
                if(j==k)  
                {
                    ret[j]=1;
                }
                else
                {
                    ret[j]=ret[j]+ret[j-1];
                }
            }
        }
        return ret;   
        
        
        
    }
};

第二种方法可以利用数学的递推关系来完成：

If anyone has ever learnt the mathematics equations related to the pascal triangle, they would know the following:

The nth row of pascal triangle will have the following format: 1 a(1) a(2) ... a(n) here we have a(1) = n; a(k+1) = a(k) * (n-k)/(k+1).

代码如下：

class Solution {
public:
    vector<int> getRow(int rowIndex) 
    {
        vector<int> A;
        if(rowIndex<0)
        {
            return A;
        }
        A.resize(rowIndex+1,0);
        A[0]=1;
        A[1]=rowIndex;
        for(int i=2;i<=rowIndex;i++)
        {
            A[i]=(double)A[i-1]*(rowIndex-(i-1))/i;	//in case of overflow
        }
        return A;
    }
};