eli和字符串

原题地址：https://ac.nowcoder.com/acm/contest/3002/G

解题思路
先对每个字母出现的次数进行统计，只对出现的次数大于大于k的字母进行处理，利用双指针（尺取法）

AC代码

#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 200000 + 10;
int alpha[26];
char str[maxn] = "";
int maxk = 0;
int n, k;

int solve()
{
	for (int i = 0; i < 26; i++)
	{
		if (maxk < alpha[i]) maxk = alpha[i];
	}
	if (maxk < k) return -1;
	int res = n;
	for (int i = 0; i < 26; i++)
	{
		if (alpha[i] >= k)
		{
			int begin = 0;
			int end = 0;
			int cur_k = 0;
			for (int j = 0; j < n; j++)
			{
				if (str[j] == (i + 'a'))
				{
					cur_k = 1;
					begin = j;
					end = j;
					break;
				}
			}
			for (end++; end < n; end++)
			{
				if (str[end] == (i + 'a'))
				{
					cur_k++;
					if (cur_k >= k)
					{
						if (cur_k > k)
						{
							for (begin++; str[begin] != (i + 'a'); begin++);
							cur_k--;
						}
						if (res > (end - begin + 1)) res = end - begin + 1;
					}
				}

			}
		}
	}
	return res;
}

int main()
{
	scanf("%d%d", &n, &k);
	scanf("%s", str);
	memset(alpha, 0, sizeof(alpha));
	for (int i = 0; i < n; i++)
	{
		alpha[str[i] - 'a']++;
	}
	int ans = solve();
	printf("%d", ans);
	return 0;
}