ninefive
diff --git a/‎src/1395.Count-Number-of-Teams/README.md
Lines changed: 57 additions & 0 deletions b/‎src/1395.Count-Number-of-Teams/README.md
Lines changed: 57 additions & 0 deletions
diff --git a/‎src/1395.Count-Number-of-Teams/Solution.go
Lines changed: 18 additions & 0 deletions b/‎src/1395.Count-Number-of-Teams/Solution.go
Lines changed: 18 additions & 0 deletions
diff --git a/‎src/1395.Count-Number-of-Teams/Solution_test.go
Lines changed: 41 additions & 0 deletions b/‎src/1395.Count-Number-of-Teams/Solution_test.go
Lines changed: 41 additions & 0 deletions
@@ -0,0 +1,57 @@
+# [1362.Closest Divisors][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-leetcode)
+
+## Description
+
+There are n soldiers standing in a line. Each soldier is assigned a unique rating value.
+
+You have to form a team of 3 soldiers amongst them under the following rules:
+
+    Choose 3 soldiers with index (i, j, k) with rating (rating[i], rating[j], rating[k]).
+    A team is valid if:  (rating[i] < rating[j] < rating[k]) or (rating[i] > rating[j] > rating[k]) where (0 <= i < j < k < n).
+
+Return the number of teams you can form given the conditions. (soldiers can be part of multiple teams).
+
+**Example 1:**
+
+```
+Input: rating = [2,5,3,4,1]
+Output: 3
+Explanation: We can form three teams given the conditions. (2,3,4), (5,4,1), (5,3,1).
+```
+
+**Example 2:**
+
+```
+Input: rating = [2,1,3]
+Output: 0
+Explanation: We can't form any team given the conditions.
+```
+
+**Example 3:**
+
+```
+Input: rating = [1,2,3,4]
+Output: 4
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+Closest Divisors
+```go
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/closest-divisors/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode
@@ -0,0 +1,18 @@
+package Solution
+
+func Solution(rating []int) int {
+	ans, n := 0, len(rating)
+	dpG, dpL := make([]int, n), make([]int, n)
+	for i, r := range rating {
+		for j := 0; j < i; j++ {
+			if r > rating[j] {
+				dpG[i]++
+				ans += dpG[j]
+			} else if r < rating[j] {
+				dpL[i]++
+				ans += dpL[j]
+			}
+		}
+	}
+	return ans
+}
@@ -0,0 +1,41 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs []int
+		expect int
+	}{
+		{"TestCase", []int{2, 5, 3, 4, 1}, 3},
+		{"TestCase", []int{2, 1, 4}, 0},
+		{"TestCase", []int{1, 2, 3, 4}, 4},
+	}
+
+	//	开始测试
+	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() {
+
+}