[leetcode]: 119. Pascal's Triangle II
2017-05-26 14:28
417 查看
1.题目
Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3,
Return [1,3,3,1].
2.分析
参考[leetcode]: 118. Pascal’s Triangle方法一样,输出不同而已
3.代码
class Solution(object): def getRow(self, rowIndex): ans=[1] for i in range(1,rowIndex+1): ans=map(lambda x,y:x+y,[0]+ans,ans+[0]) return ans
相关文章推荐
- [LeetCode]119. Pascal's Triangle II
- The Solution to Leetcode 119 Pascal's Triangle II
- 【一天一道LeetCode】#119. Pascal's Triangle II
- Leetcode 119. Pascal's Triangle II
- LeetCode WIith JS || 119. Pascal'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
- 【leetcode】119. Pascal'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(杨辉三角II)
- [LeetCode]119 Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II
- [LeetCode] 119. Pascal's Triangle II
- leetcode119~Pascal's Triangle II
- LeetCode-119:Pascal's Triangle II (返回杨辉三角指定行)
- [LeetCode By Python]119. Pascal's Triangle II