[leetcode] 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold

Description

Given an array of integers arr and two integers k and threshold.

Return the number of sub-arrays of size k and average greater than or equal to threshold.

Example 1:

Input: arr = [2,2,2,2,5,5,5,8], k = 3, threshold = 4
Output: 3
Explanation: Sub-arrays [2,5,5],[5,5,5] and [5,5,8] have averages 4, 5 and 6 respectively. All other sub-arrays of size 3 have averages less than 4 (the threshold).

Example 2:

Input: arr = [1,1,1,1,1], k = 1, threshold = 0
Output: 5

Example 3:

Input: arr = [11,13,17,23,29,31,7,5,2,3], k = 3, threshold = 5
Output: 6
Explanation: The first 6 sub-arrays of size 3 have averages greater than 5. Note that averages are not integers.

Example 4:

Input: arr = [7,7,7,7,7,7,7], k = 7, threshold = 7
Output: 1

Example 5:

Input: arr = [4,4,4,4], k = 4, threshold = 1
Output: 1

Constraints:

1. 1 <= arr.length <= 10^5
2. 1 <= arr[i] <= 10^4
3. 1 <= k <= arr.length
4. 0 <= threshold <= 10^4

分析

题目的意思是：给定一个数组，求有多少个长度为K的子数组的均值待遇或者等于阈值。这里用一个数组来保存前i个数的和，然后再遍历的时候取k个数来判断是否符合要求，如果能够想到这里，就好办了。

代码

class Solution:
    def numOfSubarrays(self, arr: List[int], k: int, threshold: int) -> int:
        n=len(arr)
        a=[0]*(n+1)
        for i in range(1,n+1):
            a[i]=arr[i-1]+a[i-1]
        cnt=0
        for i in range(k,n+1):
            res=a[i]-a[i-k]
            if(res/k>=threshold):
                cnt+=1
        return cnt

参考文献

[LeetCode] Distribute Candies 分糖果