Merge pull request #826 from 0xff-dev/2962

Add solution and test-cases for problem 2962

Author: 6boris

leetcode/2901-3000/2962.Count-Subarrays-Where-Max-Element-Appears-at-Least-K-Times/README.md

@@ -1,28 +1,27 @@
 # [2962.Count Subarrays Where Max Element Appears at Least K Times][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
+You are given an integer array `nums` and a **positive** integer `k`.
+
+Return the number of subarrays where the **maximum** element of `nums` appears **at least** `k` times in that subarray.
+
+A **subarray** is a contiguous sequence of elements within an array.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: nums = [1,3,2,3,3], k = 2
+Output: 6
+Explanation: The subarrays that contain the element 3 at least 2 times are: [1,3,2,3], [1,3,2,3,3], [3,2,3], [3,2,3,3], [2,3,3] and [3,3].
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Count Subarrays Where Max Element Appears at Least K Times
-```go
 ```
-
+Input: nums = [1,4,2,1], k = 3
+Output: 0
+Explanation: No subarray contains the element 4 at least 3 times.
+```
 
 ## 结语
 

leetcode/2901-3000/2962.Count-Subarrays-Where-Max-Element-Appears-at-Least-K-Times/Solution.go

@@ -1,5 +1,29 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(nums []int, k int) int64 {
+	ans := int64(0)
+	m := nums[0]
+	for i := 1; i < len(nums); i++ {
+		if nums[i] > m {
+			m = nums[i]
+		}
+	}
+	indies := make([]int, 0)
+	for i := 0; i < len(nums); i++ {
+		if nums[i] == m {
+			indies = append(indies, i)
+		}
+	}
+	ll := len(nums)
+	if ll < k {
+		return ans
+	}
+	le := 0
+	for s, e := 0, k-1; e < len(indies); s, e = s+1, e+1 {
+		left := int64(indies[s] - le)
+		right := int64(ll - 1 - indies[e])
+		ans += left + right + left*right + 1
+		le = indies[s] + 1
+	}
+	return ans
 }

leetcode/2901-3000/2962.Count-Subarrays-Where-Max-Element-Appears-at-Least-K-Times/Solution_test.go

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