原题链接:https://leetcode.cn/problems/count-complete-subarrays-in-an-array/
一开始的做法比较简单粗暴,复杂度是O(n*n)
func countCompleteSubarrays(nums []int) int {
cnt1 := make(map[int]int)
for _, num := range nums {
cnt1[num]++
}
count := len(cnt1)
n := len(nums)
res := 0
for i := 0; i < n; i ++ {
cnt2 := make(map[int]int)
for j := i; j < n; j++ {
cnt2[nums[j]]++
if len(cnt2) == count {
res++
}
}
}
return res
}
但是这类题目其实都是考虑是否能用滑动窗口来做的,只不过有时候不容易想到
func countCompleteSubarrays(nums []int) int {
cnt1 := make(map[int]int)
for _, num := range nums {
cnt1[num]++
}
count := len(cnt1)
i := 0
cnt2 := make(map[int]int)
res := 0
for _, num := range nums {
cnt2[num]++
for len(cnt2) == count {
cnt2[nums[i]]--
if cnt2[nums[i]] == 0 {
delete(cnt2, nums[i])
}
i++
}
res += i
}
return res
}