add some solution

Author: Cori1109

lcof/of010-I/Solution.go

@@ -3,28 +3,29 @@ package Solution
 import "math"
 
 //	递归题解
-func Fibonacci(n int) int {
+func fib(n int) int {
 	if n == 0 || n == 1 {
 		return n
 	}
-	return Fibonacci(n-1) + Fibonacci(n-2)
+	return (fib(n-1) + fib(n-2)) % 1000000007
 }
 
 //	自顶向下推导
-func Fibonacci2(n int) int {
-	a, b := 0, 1
+func fib2(n int) int {
+	a, b, sum := 0, 1, 0
 
 	for i := 1; i <= n; i++ {
-		a = a + b
-		b = a - b
+		sum = (a + b) % 1000000007
+		a = b
+		b = sum
 	}
 	return a
 }
 
 //	推导公式1
-func Fibonacci3(n int) int {
+func fib3(n int) int {
 	a := math.Sqrt(5) / 5
 	b := math.Pow((1+math.Sqrt(5))/2, float64(n))
 	c := math.Pow((1-math.Sqrt(5))/2, float64(n))
-	return int(a * (b - c))
+	return int(a*(b-c)) % 1000000007
 }

lcof/of010-I/Solution_test.go

@@ -11,9 +11,9 @@ import (
 type SolutionFuncType func(int) int
 
 var SolutionFuncList = []SolutionFuncType{
-	Fibonacci,
-	Fibonacci2,
-	Fibonacci3,
+	fib,
+	fib2,
+	fib3,
 }
 
 //	test info struct
@@ -40,6 +40,11 @@ var cases = []Case{
 		inputs: 13,
 		expect: 233,
 	},
+	{
+		name:   "TestCase 3",
+		inputs: 45,
+		expect: 134903163,
+	},
 }
 
 // TestSolution Example for solution test cases

lcof/of042/README.md

@@ -0,0 +1,32 @@
+# [OF0.Template Title][title]
+
+> [!WARNING|style:flat]
+> This problem is temporarily not PR, please submit [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+
+## 题目描述
+....
+
+**范例 :**
+
+```
+Input: n=1
+Output: 1
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+```go
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

lcof/of042/Solution.go

@@ -0,0 +1,19 @@
+package Solution
+
+func maxSubArray(nums []int) int {
+	ans := nums[0]
+	for i := 1; i < len(nums); i++ {
+		if nums[i-1] > 0 {
+			nums[i] += nums[i-1]
+		}
+		ans = max(ans, nums[i])
+	}
+	return ans
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}

lcof/of042/Solution_test.go

@@ -0,0 +1,47 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func([]int) int
+
+var SolutionFuncList = []SolutionFuncType{
+	maxSubArray,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs []int
+	expect int
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: []int{-2, 1, -3, 4, -1, 2, 1, -5, 4},
+		expect: 6,
+	},
+}
+
+// TestSolution Example for solution test cases
+func TestSolution(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, f := range SolutionFuncList {
+		for _, c := range cases {
+			t.Run(c.name, func(t *testing.T) {
+				actual := f(c.inputs)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}

lcof/of047/README.md

@@ -0,0 +1,32 @@
+# [OF0.Template Title][title]
+
+> [!WARNING|style:flat]
+> This problem is temporarily not PR, please submit [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+
+## 题目描述
+....
+
+**范例 :**
+
+```
+Input: n=1
+Output: 1
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+```go
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

lcof/of047/Solution.go

@@ -0,0 +1,26 @@
+package Solution
+
+func maxValue(grid [][]int) int {
+	row, col := len(grid), len(grid[0])
+	for i := 0; i < row; i++ {
+		for j := 0; j < col; j++ {
+			if i == 0 && j == 0 {
+				continue
+			} else if i == 0 {
+				grid[i][j] += grid[i][j-1]
+			} else if j == 0 {
+				grid[i][j] += grid[i-1][j]
+			} else {
+				grid[i][j] += max(grid[i][j-1], grid[i-1][j])
+			}
+		}
+	}
+	return grid[row-1][col-1]
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}

lcof/of047/Solution_test.go

@@ -0,0 +1,51 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func([][]int) int
+
+var SolutionFuncList = []SolutionFuncType{
+	maxValue,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs [][]int
+	expect int
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name: "TestCase 1",
+		inputs: [][]int{
+			{1, 3, 1},
+			{1, 5, 1},
+			{4, 2, 1},
+		},
+		expect: 12,
+	},
+}
+
+// TestSolution Example for solution test cases
+func TestSolution(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, f := range SolutionFuncList {
+		for _, c := range cases {
+			t.Run(c.name, func(t *testing.T) {
+				actual := f(c.inputs)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}

lcof/of049/README.md

@@ -0,0 +1,32 @@
+# [OF0.Template Title][title]
+
+> [!WARNING|style:flat]
+> This problem is temporarily not PR, please submit [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+
+## 题目描述
+....
+
+**范例 :**
+
+```
+Input: n=1
+Output: 1
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+```go
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

lcof/of049/Solution.go

@@ -0,0 +1,27 @@
+package Solution
+
+func nthUglyNumber(n int) int {
+	a, b, c, dp := 0, 0, 0, make([]int, n)
+	dp[0] = 1
+
+	for i := 1; i < n; i++ {
+		n2, n3, n5 := dp[a]*2, dp[b]*3, dp[c]*5
+		dp[i] = min(min(n2, n3), n5)
+		if dp[i] == n2 {
+			a++
+		}
+		if dp[i] == n3 {
+			b++
+		}
+		if dp[i] == n5 {
+			c++
+		}
+	}
+	return dp[n-1]
+}
+func min(x, y int) int {
+	if x > y {
+		return y
+	}
+	return x
+}

lcof/of049/Solution_test.go

@@ -0,0 +1,47 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func(int) int
+
+var SolutionFuncList = []SolutionFuncType{
+	nthUglyNumber,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs int
+	expect int
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: 10,
+		expect: 12,
+	},
+}
+
+// TestSolution Example for solution test cases
+func TestSolution(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, f := range SolutionFuncList {
+		for _, c := range cases {
+			t.Run(c.name, func(t *testing.T) {
+				actual := f(c.inputs)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}