-
-
Save weppos/7843653 to your computer and use it in GitHub Desktop.
| package main | |
| import "fmt" | |
| // fibonacci is a function that returns | |
| // a function that returns an int. | |
| func fibonacci() func() int { | |
| f2, f1 := 0, 1 | |
| return func() int { | |
| f := f2 | |
| f2, f1 = f1, f+f1 | |
| return f | |
| } | |
| } | |
| func main() { | |
| f := fibonacci() | |
| for i := 0; i < 10; i++ { | |
| fmt.Println(f()) | |
| } | |
| } |
krapie
commented
Dec 7, 2022
With defer
func fibonacci() func() int {
var v0, v1 int = 0,1
advance := func () {
v0, v1 = v1, v0+v1
}
return func() int {
defer advance()
return v0
}
}
package main
import "fmt"
func fibonacci() func() uint64 {
a := uint64(0)
b := uint64(0)
c := uint64(a + b)
return func() uint64 {
if c-a > c-b {
c = c + (c - a)
a = c - b
return c
} else if c-a < c-b {
c = c + (c - b)
b = c - a
return c
} else if c == c {
a += 0
b += 1
c += 1
return c
}
return c
}
}
func main() {
f := fibonacci()
for i := 0; i < 1000; i++ {
fmt.Println(f())
}
}
package main
import "fmt"
func fibonacci() func() int {
f := [10]int{0, 1}
i := 0
return func() int {
last := i
i++
if last == 0 || last == 1 {
return f[last]
}
f[last] = f[last-1] + f[last-2]
return f[last]
}
}
func main() {
f := fibonacci()
for i := 0; i < 10; i++ {
fmt.Println(f())
}
}
package main
import "fmt"
func fibonacci() func() int {
fib, temp, next := 0, 0, 1
return func() int {
fib = temp
temp = next
next = fib + temp
return fib
}
}
func main() {
f := fibonacci()
for i := 0; i < 10; i++ {
fmt.Println(f())
}
}
package main
import "fmt"
// fibonacci is a function that returns
// a function that returns an int.
func fibonacci() func() int {
num := 0
nextNum := 1
advance := func () {
temp := nextNum
nextNum = num + nextNum
num = temp
}
return func () int {
defer advance()
return num
}
}
func main() {
f := fibonacci()
for i := 0; i < 10; i++ {
fmt.Println(f())
}
}
package main
import "fmt"
// fibonacci is a function that returns
// a function that returns an int.
func fibonacci() func() int {
f1 := 0
f2 := 1
reFunc := func() int {
f := f1
f1 = f2
f2 = f + f1
return f
}
return reFunc
}
func main() {
f := fibonacci()
for i := 0; i < 100; i++ {
fmt.Println(f())
}
}
package main
import "fmt"
func fibonacci() func() int {
a, b := 1, 0
return func() int {
a, b = b, a + b
return a
}
}
func main() {
f := fibonacci()
for i := 0; i < 10; i++ {
fmt.Println(f())
}
}
hehe basically we all disagree about variables names 😄
package main
import "fmt"
// fibonacci is a fucntion that returns
// a function that returns an int.
func fibonacci() func() int {
current, next := 0, 1
return func() int {
fib := current
current, next = next, current+next
return fib
}
}
func main() {
f := fibonacci()
for i := 0; i < 10; i++ {
fmt.Println(f())
}
}P.S.: The solution with the defer statement is pure gold 🥇
P.S.: The solution with the
deferstatement is pure gold 🥇
Could you please elaborate on what's so special about using defer here? I do not see any improvement over not using it.
Could you please elaborate on what's so special about using defer here? I do not see any improvement over not using it.
two things:
- When I was solving the exercise, using
defernever crossed my mind, so when I saw that solution it was anahá moment🤯 - I saw it as a readability improvement for sure, the combination between
Function closures(link) and thedeferstatement, imho it's way simpler to read:
func fibonacci() func() int {
current, next := 0, 1
return func() int {
defer func() {
current, next = next, current+next
}()
return current
}
}
@pabloxio, I think I understand now how it works (the trick is that values will be updated after current is returned), but I do not really see any improvement between the defer approach and something like this:
func fibonacci() func() int {
curr, next := 1, 0
return func() int {
curr, next = next, curr + next
return curr
}
}Am I missing something?
package main
import "fmt"
// fibonacci is a function that returns
// a function that returns an int.
func fibonacci() func() int {
a, b := 0, 1
return func() int {
result := a
a, b = b, a + b
return result
}
}
func main() {
f := fibonacci()
for i := 0; i < 10; i++ {
fmt.Println(f())
}
}