6boris
diff --git a/‎leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/README.md
Copy file name to clipboardExpand all lines: leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/README.md
+16-13Lines changed: 16 additions & 13 deletions b/‎leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/README.md
Copy file name to clipboardExpand all lines: leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/README.md
+16-13Lines changed: 16 additions & 13 deletions
diff --git a/‎leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/Solution.go
Copy file name to clipboard
+11-2Lines changed: 11 additions & 2 deletions b/‎leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/Solution.go
Copy file name to clipboard
+11-2Lines changed: 11 additions & 2 deletions
diff --git a/‎leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/Solution_test.go
Copy file name to clipboardExpand all lines: leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/Solution_test.go
+6-7Lines changed: 6 additions & 7 deletions b/‎leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/Solution_test.go
Copy file name to clipboardExpand all lines: leetcode/3301-3400/3392.Count-Subarrays-of-Length-Three-With-a-Condition/Solution_test.go
+6-7Lines changed: 6 additions & 7 deletions
@@ -1,28 +1,31 @@
 # [3392.Count Subarrays of Length Three With a Condition][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
+Given an integer array `nums`, return the number of subarrays of length 3 such that the sum of the first and third numbers equals exactly half of the second number.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
-```
+Input: nums = [1,2,1,4,1]
+
+Output: 1
+
+Explanation:
 
-## 题意
-> ...
+Only the subarray [1,4,1] contains exactly 3 elements where the sum of the first and third numbers equals half the middle number.
+```
 
-## 题解
+**Example 2:**
 
-### 思路1
-> ...
-Count Subarrays of Length Three With a Condition
-```go
 ```
+Input: nums = [1,1,1]
+
+Output: 0
 
+Explanation:
+
+[1,1,1] is the only subarray of length 3. However, its first and third numbers do not add to half the middle number.
+```
 
 ## 结语
 
 
@@ -1,5 +1,14 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(nums []int) int {
+	ans := 0
+	for i := 0; i < len(nums)-2; i++ {
+		a := nums[i]
+		b := nums[i+1]
+		c := nums[i+2]
+		if (a+c)*2 == b {
+			ans++
+		}
+	}
+	return ans
 }
@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs []int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []int{1, 2, 1, 4, 1}, 1},
+		{"TestCase2", []int{1, 1, 1}, 0},
 	}
 
 	//	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }
Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {`
`10`	`10`	`// 测试用例`
`11`	`11`	`cases := []struct {`
`12`	`12`	`name string`
`13`		`- inputs bool`
`14`		`- expect bool`
	`13`	`+ inputs []int`
	`14`	`+ expect int`
`15`	`15`	`}{`
`16`		`- {"TestCase", true, true},`
`17`		`- {"TestCase", true, true},`
`18`		`- {"TestCase", false, false},`
	`16`	`+ {"TestCase1", []int{1, 2, 1, 4, 1}, 1},`
	`17`	`+ {"TestCase2", []int{1, 1, 1}, 0},`
`19`	`18`	`}`
`20`	`19`
`21`	`20`	`// 开始测试`
`@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {`
`30`	`29`	`}`
`31`	`30`	`}`
`32`	`31`
`33`		`-// 压力测试`
	`32`	`+// 压力测试`
`34`	`33`	`func BenchmarkSolution(b *testing.B) {`
`35`	`34`	`}`
`36`	`35`
`37`		`-// 使用案列`
	`36`	`+// 使用案列`
`38`	`37`	`func ExampleSolution() {`
`39`	`38`	`}`