下面是几种不同版本的帕斯卡三角形的解决方法，使用了列表和Python代码：

1. 使用一维列表：

def pascal_triangle(n):
    triangle = [1]
    for i in range(n):
        yield triangle
        triangle = [1] + [triangle[j] + triangle[j+1] for j in range(len(triangle)-1)] + [1]

n = 5
for row in pascal_triangle(n):
    print(row)

2. 使用二维列表：

def pascal_triangle(n):
    triangle = [[1] * (i+1) for i in range(n)]
    for i in range(2, n):
        for j in range(1, i):
            triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j]
    return triangle

n = 5
triangle = pascal_triangle(n)
for row in triangle:
    print(row)

3. 使用递归：

def pascal_triangle(n):
    if n == 0:
        return []
    elif n == 1:
        return [[1]]
    else:
        triangle = pascal_triangle(n-1)
        last_row = triangle[-1]
        new_row = [1] + [last_row[i] + last_row[i+1] for i in range(len(last_row)-1)] + [1]
        return triangle + [new_row]

n = 5
triangle = pascal_triangle(n)
for row in triangle:
    print(row)

这些方法都可以生成帕斯卡三角形的前n行。你可以根据需要选择其中一种方法来使用。