首页 > 代码库 > LeetCode[Array]: Pascal's Triangle II
LeetCode[Array]: 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> row, prev_row; row.push_back(1); for (int i = 1; i <= rowIndex; ++i) { prev_row = row; row.clear(); row.push_back(1); for (int j = 1; j < prev_row.size(); j++) row.push_back(prev_row[j - 1] + prev_row[j]); row.push_back(1); } return row; }
更简洁的做法:
vector<int> getRow(int rowIndex) { vector<int> row(rowIndex + 1, 0); row[0] = 1; for (int i = 1; i <= rowIndex; ++i) { for (int j = i + 1; j > 0; --j) { row[j] += row[j - 1]; } } return row; }
LeetCode[Array]: Pascal's Triangle II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。