118. 杨辉三角

给定n，输出n层杨辉三角

class Solution:
	def __init__(self):
		self.ans = []
	def generate(self, numRows: int) -> List[List[int]]:
		if numRows == 0:
			return self.ans
		self.ans.append([1])
		if numRows == 1:
			return self.ans
			
		for i in range(1, numRows):
			l = [1]
			for j in range(1, i):
				l.append(self.ans[i-1][j-1] + self.ans[i-1][j])
			l.append(1)
			self.ans.append(l)
		return self.ans