leetcode 111 —— Pascal's Triangle
来源：互联网 发布：pl sql developer查询 编辑：程序博客网 时间：2024/05/21 12:25
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?
思路：同上题
class Solution {public:vector<int> getRow(int numRows) {vector<int> path;for (int i = 0; i <= numRows; i++){int tmp=1;for (int j = 1; j < i; j++){path[j]=path[j]+tmp;tmp = path[j] - tmp;}path.push_back(1);}return path;}}; 0 0
- leetcode 111 —— Pascal's Triangle
- LeetCode——Pascal's Triangle
- LeetCode——Pascal's Triangle II
- leetcode 118 —— Pascal's Triangle
- Leetcode Problem.118—Pascal's Triangle
- 【leetcode】Array—— Pascal's Triangle and Pascal's Triangle II（118/119）
- 【Leetcode】Pascal's Triangle (Pascal)
- LeetCode Pascal's Triangle
- [Leetcode] Pascal's Triangle
- LeetCode: Pascal's Triangle
- [LeetCode] Pascal's Triangle
- 【leetcode】Pascal's Triangle
- LeetCode - Pascal's Triangle
- [LeetCode]Pascal's Triangle
- Leetcode: Pascal's Triangle
- Pascal's Triangle --Leetcode
- LeetCode-Pascal's Triangle
- [leetcode] Pascal's Triangle
- UICollectionView
- linux系统下安装QT5.4
- Python中的布尔类型
- c与c++中struct区别
- 会话管理--session
- leetcode 111 —— Pascal's Triangle
- 数论 练习题【题解】
- Bound Services
- ios测试框架的理解
- hdu1513Palindrome回文数【LCS】【滚动数组】
- nyoj-448 素数环(DFS)
- json for cpp库使用介绍2
- hdu 2029 Palindromes _easy version(回文串)
- UIimageView动画浅析
