Haskell中的Fibonacci数

bor*_*aer 3 haskell

嗨,我需要将我的F#代码更改为Haskell代码,但我在Haskell中是如此新,我不能这样我的代码只是从键盘读取数据,如果数据不是整数返回错误消息然后计算n斐波纳契数然后写入list之后将列表写入txt文件这是我的代码

open System
let rec fib n = 
    match n with
    |0->0
    |1->1
    |2->1
    |n->fib(n-1)+fib(n-2);;

let printFibonacci list = 
    for i=0 to (List.length list)-1 do
        printf "%d " (list.Item(i));;

let writeToFile list = 
    let file = System.IO.File.Create("C:\out2.txt")
    let mutable s =""
    let writer = new System.IO.StreamWriter(file)
    try
        for i=0 to (List.length list)-1 do
        s <- list.Item(i).ToString()
        writer.Write(s+" ")

    finally
        writer.Close()
        file.Dispose()
        printfn "Writed To File"


let mutable control = true
let mutable num = 0
while control do 
    try
    printfn "Enter a Number:" 

    num <- Convert.ToInt32(stdin.ReadLine()) 
    let listFibonacci = [for i in 0 .. num-1->fib(i)]
    printFibonacci(listFibonacci)
    printfn "\n%A"(listFibonacci)
    writeToFile(listFibonacci)
    control<-false
    with
        | :? System.FormatException->printfn "Number Format Exception";

Console.ReadKey true|>ignore
Run Code Online (Sandbox Code Playgroud)

sep*_*p2k 15

fib 0 = 0
fib 1 = 1
fib n = fib (n-1) + fib (n-2)

main = do putStrLn "Enter a number:"
          num <- readLn
          fibs = map fib [0..n]
          mapM' print fibs
Run Code Online (Sandbox Code Playgroud)

然而,因为haskell是懒惰的,所以有一种聪明的方法来定义所有斐波纳契数列表.而且由于您需要该列表的前缀,因此使用此定义更自然(也更高效):

fibs = 0 : 1 : zipWith (+) fibs (tail fibs)

main = do putStrLn "Enter a number:"
          num <- readLn
          mapM' print (take n fibs)
Run Code Online (Sandbox Code Playgroud)

编辑:写入文件而不是stdout替换print(\num -> appendFile "filename" (show num))(appendFile "filename" . show).