简单输出杨辉三角

def l(n):
if n1:
return [1]
if n2:
return [1,1]
if n>2:
l1=[]
for i in range(n-2):
s=l(n-1)[i]+l(n-1)[i+1]
l1.append(s)
l1.append(1)
l1.insert(0,1)
return l1
def yh(h):
for j in range(1,h+1):
print(l(j))
yh(5)