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?
代码:
public class Solution {
public List<Integer> getRow(int rowIndex) {
Integer[] result=new Integer[rowIndex+1];
for(int i=0;i<=rowIndex;i++)
{
int temp=0,temp1=0;;
if(i==0)
{
result[0]=1;
}
else if(i==1)
{
result[0]=1;
result[1]=1;
}
else
{
temp=result[0];
for(int j=1;j<i;j++)
{
temp1=result[j];
result[j]=temp1+temp;
temp=temp1;
}
}
result[i]=1;
}
return Arrays.asList(result);
}
}