Update 509

halfrost · halfrost · commit 3665fc17fbdb · 2021-02-03T16:22:37.000+08:00
diff --git a/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go b/leetcode/0509.Fibonacci-Number/509. Fibonacci Number.go
@@ -108,3 +108,22 @@ func fib5(N int) int {
 	var goldenRatio float64 = float64((1 + math.Sqrt(5)) / 2)
 	return int(math.Round(math.Pow(goldenRatio, float64(N)) / math.Sqrt(5)))
 }
+
+// 解法七 协程版，但是时间特别慢，不推荐，放在这里只是告诉大家，写 LeetCode 算法题的时候，启动 goroutine 特别慢
+func fib6(N int) int {
+    return <-fibb(N)
+}
+
+func fibb(n int) <- chan int {
+    result := make(chan int)
+    go func() {
+        defer close(result)
+        
+        if n <= 1 {
+            result <- n
+            return
+        }
+        result <- <-fibb(n-1) + <-fibb(n-2)
+    }()
+    return result
+}
diff --git a/website/content/ChapterFour/0509.Fibonacci-Number.md b/website/content/ChapterFour/0509.Fibonacci-Number.md
@@ -168,6 +168,25 @@ func fib5(N int) int {
 	return int(math.Round(math.Pow(goldenRatio, float64(N)) / math.Sqrt(5)))
 }
 
+// 解法七 协程版，但是时间特别慢，不推荐，放在这里只是告诉大家，写 LeetCode 算法题的时候，启动 goroutine 特别慢
+func fib6(N int) int {
+    return <-fibb(N)
+}
+
+func fibb(n int) <- chan int {
+    result := make(chan int)
+    go func() {
+        defer close(result)
+        
+        if n <= 1 {
+            result <- n
+            return
+        }
+        result <- <-fibb(n-1) + <-fibb(n-2)
+    }()
+    return result
+}
+
 ```
 
 
