2845. 统计趣味子数组的数目

2845. 统计趣味子数组的数目

题目链接：2845. 统计趣味子数组的数目

代码如下：

//参考链接：https://leetcode.cn/problems/count-of-interesting-subarrays/solutions/2424063/qian-zhui-he-ha-xi-biao-fu-ti-dan-by-end-74bb
class Solution{
public:
	long long countInterestingSubarrays(vector<int>& nums, int modulo, int k) {
		long long res = 0;
		vector<int> cnt(min((int)nums.size() + 1, modulo));
		cnt[0] = 1;
		int s = 0;
		for (int x : nums) {
			s += x % modulo == k;
			if (s >= k) {
				res += cnt[(s - k) % modulo];
			}
			cnt[s % modulo]++;
		}
		return res;
	}
};