进阶:
你可以优化你的算法到 O(k) 空间复杂度吗?
class Solution:
def getRow(self, rowIndex: int) -> List[int]:
if rowIndex == 0:return [1]
L = [1]
L1 = [0] + L
L2 = L + [0]
#temp = []
n = 0
while(n < rowIndex):
temp = []
for i in range(len(L1)):
temp.append(L1[i] + L2[i])
L1 = [0] + temp
L2 = temp + [0]
n += 1
return temp
不细心,rowIndex = 1时,应返回[1]而不是[]