leetcode #119 in cpp
来源：互联网 发布：数控内圆磨床编程 编辑：程序博客网 时间：2024/04/27 15:26
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?
Code:
class Solution {public: vector<int> getRow(int rowIndex) { vector<int> res; if(rowIndex < 0) return res; res.push_back(1); rowIndex --; while(rowIndex >= 0){ res.insert(res.begin(), 1); for(int i = 1; i < res.size(); i ++){ if(i+1 < res.size()) res[i] = res[i] + res[i+1]; } rowIndex --; } return res; }}; 0 0
- leetcode #119 in cpp
- leetcode #12 in cpp
- Leetcode #13 in cpp
- Leetcode #14 in cpp
- leetcode %15 in cpp
- leetcode #16 in cpp
- leetcode #17 in cpp
- leetcode #18 in cpp
- leetcode #20 in cpp
- leetcode #21 in cpp
- leetcode #22 in cpp
- leetcode #23 in cpp
- leetcode #24 in cpp
- leetcode #25 in cpp
- leetcode #26 in cpp
- leetcode #27 in cpp
- leetcode #28 in cpp
- leetcode #29 in cpp
- leetcode #116 in cpp
- leetcode #117 in cpp
- PHP命名空间(Namespace)的使用详解
- rfs(robot_framewok)的搭建
- leetcode #118 in cpp
- leetcode #119 in cpp
- parameter与define 区别
- HttpClient 4.* connectionRequestTimeout, connectionTimeOut, socketTimeOut
- iOS开发 ☞ UITableView详解（二）
- 关于 Activity的生命周期
- 国行手机安装Google play store
- 不同系统文本结束标记
- 文本查看命令 - cat和tac
- 勾股定理一日一证连载27
