add 2301-2400 problems and 2357 solution

Author: Cori1109

cmd/main.go

@@ -30,6 +30,8 @@ func main() {
 	//leetcode.MakeDirFromTo(problems, 2001, 2100)
 	//leetcode.MakeDirFromTo(problems, 2101, 2200)
 	//leetcode.MakeDirFromTo(problems, 2201, 2300)
+	//leetcode.MakeDirFromTo(problems, 2301, 2400)
+
 	// leetcode.MakeDir(problems)
 
 	// leetcode.GetReadmeTemplateBuffer()

leetcode/2301-2400/2301.Match-Substring-After-Replacement/README.md

@@ -0,0 +1,32 @@
+# [2301.Match Substring After Replacement][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Match Substring After Replacement
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/match-substring-after-replacement/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/2301-2400/2301.Match-Substring-After-Replacement/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/2301-2400/2301.Match-Substring-After-Replacement/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/2301-2400/2302.Count-Subarrays-With-Score-Less-Than-K/README.md

@@ -0,0 +1,32 @@
+# [2302.Count Subarrays With Score Less Than K][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Count Subarrays With Score Less Than K
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/count-subarrays-with-score-less-than-k/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/2301-2400/2302.Count-Subarrays-With-Score-Less-Than-K/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/2301-2400/2302.Count-Subarrays-With-Score-Less-Than-K/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/2301-2400/2303.Calculate-Amount-Paid-in-Taxes/README.md

@@ -0,0 +1,32 @@
+# [2303.Calculate Amount Paid in Taxes][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Calculate Amount Paid in Taxes
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/calculate-amount-paid-in-taxes/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/2301-2400/2303.Calculate-Amount-Paid-in-Taxes/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/2301-2400/2303.Calculate-Amount-Paid-in-Taxes/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/2301-2400/2304.Minimum-Path-Cost-in-a-Grid/README.md

@@ -0,0 +1,32 @@
+# [2304.Minimum Path Cost in a Grid][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Minimum Path Cost in a Grid
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/minimum-path-cost-in-a-grid/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/2301-2400/2304.Minimum-Path-Cost-in-a-Grid/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}

leetcode/2301-2400/2304.Minimum-Path-Cost-in-a-Grid/Solution_test.go

@@ -0,0 +1,39 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs bool
+		expect bool
+	}{
+		{"TestCase", true, true},
+		{"TestCase", true, true},
+		{"TestCase", false, false},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+//	使用案列
+func ExampleSolution() {
+}

leetcode/2301-2400/2305.Fair-Distribution-of-Cookies/README.md

@@ -0,0 +1,32 @@
+# [2305.Fair Distribution of Cookies][title]
+
+> [!WARNING|style:flat]
+> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+## Description
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Fair Distribution of Cookies
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/fair-distribution-of-cookies/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/2301-2400/2305.Fair-Distribution-of-Cookies/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+	return x
+}