Pascal's Triangle II
Posted lcchuguo
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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]
.
Note:
Could you optimize your algorithm to use only O(k) extra space?
vector<int> getRow(int rowIndex) { vector<int> result(1,1); if(rowIndex==0)return result; result.push_back(1); if(rowIndex==1)return result; int i=2; while(i!=rowIndex+1) { vector<int> tmp(result); for(int j=1;j<i;j++) { result[j]=tmp[j-1]+tmp[j]; } result.push_back(1); i++; } return result; }
以上是关于Pascal's Triangle II的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode118:Pascal's Triangle
[Leetcode]-Pascal's Triangle
leetcode笔记:Pascal's Triangle