The Solution to Leetcode 119 Pascal's Triangle II
来源:互联网 发布:淘宝直通车定向推广 编辑:程序博客网 时间:2024/06/11 13:35
Question:
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
Answer:
class Solution {public: vector<int> getRow(int rowIndex) { vector<int> a(rowIndex + 1); a[0] = 1; for(int i = 1; i <= rowIndex; i++) { for(int j = i; j >= 0; j--) { if (j == i) a[j] = a[j-1]; else if (j == 0) a[j] = a[j]; else a[j] = a[j-1] + a[j]; } } return a; }};
run code results:
Your input
3
Your answer
[1,3,3,1]
Expected answer
[1,3,3,1]
阅读全文
0 0
- The Solution to Leetcode 119 Pascal's Triangle II
- The Solution to Leetcode 118 Pascal's Triangle
- LeetCode 119: Pascal's Triangle II
- LeetCode(119)Pascal's Triangle II
- LeetCode: Pascal's Triangle II [119]
- LeetCode 119 Pascal's Triangle II
- LeetCode 119 Pascal's Triangle II
- [leetcode 119] Pascal's Triangle II
- Leetcode NO.119 Pascal's Triangle II
- LeetCode 119 Pascal's Triangle II
- leetCode #119Pascal's Triangle II
- LeetCode 119: Pascal's Triangle II
- leetcode 119:Pascal's Triangle II
- leetcode-119 Pascal's Triangle II
- LeetCode(119) Pascal's Triangle II (Java)
- leetcode || 119、Pascal's Triangle II
- LeetCode 119:Pascal's Triangle II
- Leetcode[119]-Pascal's Triangle II
- mysql索引种类、索引结构、索引优化
- RT-thread内核之定时器管理
- POJ2411_Mondriaan's Dream_轮廓线dp
- IBM Websphere MQ _02 MQ消息队列、通道、消息的创建及传输
- 归纳AOP在Android开发中的几种常见用法
- The Solution to Leetcode 119 Pascal's Triangle II
- 我的vim开发环境配置
- android三大动画的基本使用
- android跑马灯
- 正则表达式
- iOS自定义代码块
- 揭密出席第九届中国云计算大会的专家—近20个国家学者共话云计算大数据生态、应用
- iReport使用入门
- LeetCode 389. Find the Difference(异或)