Add files via upload

Author: yuxiaoba

go/10_recursion/Factorial.go

@@ -0,0 +1,31 @@
+package Recursion
+
+// 迭代实现阶乘
+type Fac struct {
+	val map[int]int
+}
+
+func  NewFactorial(n int) *Fac {
+	return &Fac{
+		make(map[int]int, n),
+	}
+}
+
+func (fac *Fac) Factorial(n int) int {
+	if fac.val[n] != 0{
+		return fac.val[n]
+	}
+
+	if n <= 1{
+		fac.val[n] = 1
+		return 1
+	}else {
+		res := n * fac.Factorial(n-1)
+		fac.val[n] =res
+		return res
+	}
+}
+
+func (fac *Fac) Print(n int )  {
+	println(fac.val[n])
+}

go/10_recursion/Factorial_test.go

@@ -0,0 +1,11 @@
+package Recursion
+
+import "testing"
+
+func TestFac_Factorial(t *testing.T) {
+	fac := NewFactorial(10)
+	for i:=1; i<15; i++{
+		fac.Factorial(i)
+		fac.Print(i)
+	}
+}

go/10_recursion/Fibonacci.go

@@ -0,0 +1,35 @@
+package Recursion
+
+import "fmt"
+
+// 递归实现斐波那契数列
+type Fibs struct {
+	val map[int]int  // 使用字典存储结果
+}
+
+func NewFibs(n int) *Fibs  {
+	return &Fibs{
+		make(map[int]int, n),
+	}
+}
+
+func (fib *Fibs)Fibonacci(n int) int {
+	if fib.val[n] != 0{
+		return fib.val[n]
+	}
+	if n <= 1 {
+		fib.val[1] = 1
+		return 1
+	}else if n ==2{
+		fib.val[2] = 1
+		return 1
+	} else {
+		res := fib.Fibonacci(n-1) + fib.Fibonacci(n-2)
+		fib.val[n] = res
+		return res
+	}
+}
+
+func (fib *Fibs)Print(n int) {
+	fmt.Println(fib.val[n])
+}

go/10_recursion/Fibonacci_test.go

@@ -0,0 +1,11 @@
+package Recursion
+
+import "testing"
+
+func TestFibs_Fibonacci(t *testing.T) {
+	fib := NewFibs(10)
+	for i:=1; i<15; i++{
+		fib.Fibonacci(i)
+		fib.Print(i)
+	}
+}