119. Pascal's Triangle II(unsolved)
2017-03-25 16:42
381 查看
Given an index k, return the kth row of the Pascal’s triangle.
For example, given k = 3,
Return [1,3,3,1].
解答:一定要从后往前计算。
For example, given k = 3,
Return [1,3,3,1].
解答:一定要从后往前计算。
class Solution { public: vector<int> getRow(int rowIndex) { vector<int>result(rowIndex+1,0); result[0]=1; for(int i=1;i<=rowIndex;i++) { for(int j=i;j>=1;j--) { result[j]=result[j]+result[j-1]; } } return result; } };
相关文章推荐
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II Python
- LeetCode 119. Pascal's Triangle II
- 【一天一道LeetCode】#119. Pascal's Triangle II
- 119. Pascal's Triangle II
- [LeetCode] 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- [leetCode 118 & 119] Pascal's Triangle I && II (杨辉三角问题)
- 119. Pascal's Triangle II LeetCode
- [leetcode]#119. Pascal's Triangle II
- leecode 解题总结:119. Pascal's Triangle II
- LeetCode 119: Pascal's Triangle II
- [Leetcode]#119 Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- [Leetcode 118 and 119, Easy] Pascal's Triangle (I and II)
- LeetCode 119. Pascal's Triangle II
- 119. Pascal's Triangle II