求斐波那契数列的前N项。斐波那契数列中某个元素的值等于其前两个元素值之和，第1个元素和第2个元素都为1。即a[0]=1,a[1]=1,a[2]=2,a[3]=3,a[4]=5,a[5]=8 ......

def fibonacci(n):
    if n <= 0:
        return []
    elif n == 1:
        return [1]
    elif n == 2:
        return [1, 1]
    
    fib_seq = [1, 1]
    for i in range(2, n):
        fib_seq.append(fib_seq[i-1] + fib_seq[i-2])
    
    return fib_seq

N = 6  # 指