LeetCode:Pascal's Triangle II
2015-02-02 21:40
302 查看
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return
Note:
Could you optimize your algorithm to use only O(k) extra space?
For example, given k = 3,
Return
[1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
// https://oj.leetcode.com/problems/pascals-triangle-ii/ // Author : Chao Zeng // Date : 2015-2-2 class Solution { public: vector<int> getRow(int rowIndex) { vector<int> line; vector<int> nextline; if (rowIndex < 0) return line; line.push_back(1); if (rowIndex == 0) return line; for (int i = 1; i <= rowIndex; i++){ nextline.push_back(1); for (int j = 0; j < i - 1; j++){ nextline.push_back(line[j] + line[j+1]); } nextline.push_back(1); line = nextline; nextline.clear(); } return line; } };
相关文章推荐
- [LeetCode] 一个BST的两个节点的值被交换,要求修正这个BST
- 【LeetCode】Next Permutation
- leetcode--Add Binary
- LeetCode: Search in Rotated Sorted Array
- leetcode subset ||
- c++ leetcode generate parentheses
- leetcode 之Largest Number
- 47. Permutation II Leetcode Python
- Java for LeetCode 165 Compare Version Numbers
- LeetCode Isomorphic Strings
- LeetCode Remove Duplicates from Sorted Array II
- LeetCode 78: Subsets
- 【LEETCODE】28-Implement strStr()
- leetcode 27 Remove Element
- Leetcode 28 Implement strStr()
- leetcode----Trapping Rain Water
- leetcode--011 Container With Most Water
- LeetCode 35题解
- [LeetCode]Sort Colors
- [LeetCode] 115. Distinct Subsequences