[Array]-119. Pascal's Triangle II(@python)解题报告
2017-11-19 18:17
405 查看
原题链接:https://leetcode.com/problems/pascals-triangle-ii/description/
题意:这道题和118题类似,但是这道题要求的输出是第k行的输出即可。
思路:可以利用杨辉三角一个很重要的特性快速得到结果,那就是一行的数组可以有上一行的数组前后分别添加0 相加得到
题解:
class Solution(object):
def getRow(self, rowIndex):
"""
:type rowIndex: int
:rtype: List[int]
"""
"""
Time Complexity:O(K^2)
Space Complexity:O(K)
"""
row = [1]
for _ in range(rowIndex):
row = [x + y for x, y in zip([0] + row, row + [0])]
return row
题意:这道题和118题类似,但是这道题要求的输出是第k行的输出即可。
思路:可以利用杨辉三角一个很重要的特性快速得到结果,那就是一行的数组可以有上一行的数组前后分别添加0 相加得到
题解:
class Solution(object):
def getRow(self, rowIndex):
"""
:type rowIndex: int
:rtype: List[int]
"""
"""
Time Complexity:O(K^2)
Space Complexity:O(K)
"""
row = [1]
for _ in range(rowIndex):
row = [x + y for x, y in zip([0] + row, row + [0])]
return row
相关文章推荐
- [Array]-118. Pascal's Triangle(@python)解题报告
- Leetcode 119. Pascal's Triangle II 杨辉三角2 解题报告
- 【LeetCode】119.Pascal's Triangle II(Easy)解题报告
- [Leetcode] 119. Pascal's Triangle II 解题报告
- LeetCode119. Pascal's Triangle II-python(easy)
- 119. Pascal's triangle II Leetcode Python
- 【LeetCode】Pascal's Triangle II 解题报告
- 【LeetCode】462. Minimum Moves to Equal Array Elements II 解题报告(Python)
- leecode 解题总结:119. Pascal's Triangle II
- LeetCode-Array-119. Pascal's Triangle II
- leetcode 119 Pascal's Triangle II(array)
- 119. Pascal's Triangle II -- Python
- [LeetCode By Python]119. Pascal's Triangle II
- [LeetCode] Pascal's Triangle II 解题报告
- 119. Pascal's Triangle II Python
- 【LeetCode】Pascal's Triangle II 解题报告
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- [leetcode, python] Pascal's Triangle II 杨辉三角
- 119. Pascal's Triangle II