Swift 3中的Fibonacci数生成器

func fibonacci(n: Int) -> [Int] {
    if n <= 0 {
        return []
    }
    
    var fibs = [0, 1]
    for i in 2..<n {
        fibs.append(fibs[i - 1] + fibs[i - 2])
    }
    
    return fibs
}

// 示例调用
let fibSequence = fibonacci(n: 10)
print(fibSequence)  // 输出: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

func fibonacciRecursive(n: Int) -> Int {
    if n <= 1 {
        return n
    }
    return fibonacciRecursive(n: n - 1) + fibonacciRecursive(n: n - 2)
}

// 示例调用
let fibNumber = fibonacciRecursive(n: 10)
print(fibNumber)  // 输出: 55

func fibonacciDP(n: Int) -> Int {
    if n <= 1 {
        return n
    }
    
    var fib = [0, 1]
    for i in 2...n {
        fib.append(fib[i - 1] + fib[i - 2])
    }
    
    return fib[n]
}

// 示例调用
let fibNumberOptimized = fibonacciDP(n: 10)
print(fibNumberOptimized)  // 输出: 55