LeetCode119——Pascal's Triangle II
2015-01-27 18:15
489 查看
Given an index k, return the kth row of the Pascal's triangle.
Note: Could you optimize your algorithm to use only O(k) extra space?
题目大意
给定一个索引k,返回第k行帕斯卡三角的数据。
难度系数:容易
实现
代码一次性通过。当然,我这个使用递归的做法,占用的空间会比较多,可以使用for循环来优化。
[code]For example, given k = 3, Return [1,3,3,1].
Note: Could you optimize your algorithm to use only O(k) extra space?
题目大意
给定一个索引k,返回第k行帕斯卡三角的数据。
难度系数:容易
实现
代码一次性通过。当然,我这个使用递归的做法,占用的空间会比较多,可以使用for循环来优化。
[code] vector<int> getRow(int rowIndex) { vector<int> vi; if (rowIndex == 0) { vi.push_back(1); }else { std::vector<int> tempv = getRow(rowIndex - 1); for (int i = 0; i < rowIndex+1; ++i) { if (i == 0 || i == rowIndex) { vi.push_back(1); } else { vi.push_back(tempv[i-1] + tempv[i]); } } } return vi; }
相关文章推荐
- [Leetcode 118 and 119, Easy] Pascal's Triangle (I and II)
- leetcode:119 Pascal's Triangle II-每日编程第二十五题
- [leetCode 118 & 119] Pascal's Triangle I && II (杨辉三角问题)
- LeetCode 118, 119. Pascal's Triangle i, ii
- leetcode-118&119 Pascal's Triangle I & II
- <LeetCode OJ> 118./119. Pascal's Triangle(I / II)
- leetcode:Pascal's Triangle II 【Java】
- Pascal's Triangle II--LeetCode
- 119. Pascal's Triangle II
- leetcode -day13 Valid Palindrome & Triangle & Pascal's Triangle I II
- LeetCode 之 Pascal's Triangle II
- leetcode Pascal's Triangle II
- LeetCode - Pascal's Triangle I && II
- leetcode -- Pascal's Triangle II -- 简单
- [leetcode]Pascal's Triangle II
- [LeetCode]-Pascal's Triangle I&II 杨辉三角问题
- leetcode题解-118. Pascal's Triangle && 119. Pascal's Triangle II
- LeetCode - Pascal's Triangle II
- LeetCode-118. Pascal's Triangle,119. Pascal's Triangle II
- [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II