ne[]数组的应用Cyclic Nacklace

最新推荐文章于 2020-10-18 21:42:19 发布

mrgaohaihang

最新推荐文章于 2020-10-18 21:42:19 发布

阅读量146

点赞数

分类专栏：基础算法

本文链接：https://blog.csdn.net/mrgaohaihang/article/details/105799201

版权

基础算法专栏收录该内容

77 篇文章 0 订阅

订阅专栏

CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to tide over the last days. Being inspired by the entrepreneurial spirit of “HDU CakeMan”, he wants to sell some little things to make money. Of course, this is not an easy task.

As Christmas is around the corner, Boys are busy in choosing christmas presents to send to their girlfriends. It is believed that chain bracelet is a good choice. However, Things are not always so simple, as is known to everyone, girl’s fond of the colorful decoration to make bracelet appears vivid and lively, meanwhile they want to display their mature side as college students. after CC understands the girls demands, he intends to sell the chain bracelet called CharmBracelet. The CharmBracelet is made up with colorful pearls to show girls’ lively, and the most important thing is that it must be connected by a cyclic chain which means the color of pearls are cyclic connected from the left to right. And the cyclic count must be more than one. If you connect the leftmost pearl and the rightmost pearl of such chain, you can make a CharmBracelet. Just like the pictrue below, this CharmBracelet’s cycle is 9 and its cyclic count is 2:

Now CC has brought in some ordinary bracelet chains, he wants to buy minimum number of pearls to make CharmBracelets so that he can save more money. but when remaking the bracelet, he can only add color pearls to the left end and right end of the chain, that is to say, adding to the middle is forbidden.
CC is satisfied with his ideas and ask you for help.

Input

The first line of the input is a single integer T ( 0 < T <= 100 ) which means the number of test cases.
Each test case contains only one line describe the original ordinary chain to be remade. Each character in the string stands for one pearl and there are 26 kinds of pearls being described by ‘a’ ~‘z’ characters. The length of the string Len: ( 3 <= Len <= 100000 ).

Output

For each case, you are required to output the minimum count of pearls added to make a CharmBracelet.

Sample Input

3
aaa
abca
abcde

Sample Output

0
2
5

这题的意思就是至少加几个字符串使文本串成为一个可循环的串

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int ne[1000005];
int main()
{
	int n;
	char s[1000005];
	cin >> n;
	while (n--)
	{
		scanf("%s", s + 1);
		memset(ne, 0, sizeof(ne));
		int l = strlen(s + 1);
		for (int i = 2, j = 0; i <= l; i++)
		{
			while (j&&s[i] != s[j + 1])j = ne[j];
			if (s[i] == s[j + 1])j++;
			ne[i] = j;
		}
		int x = l - ne[l];//神奇的很这里是循环数从字符串尾来计算
		if (x != l && l%x == 0)printf("0\n");//x！=l
		//是排除样例三这种情况的，如果反复出现则不需要添加东西
		else printf("%d\n", x - ne[l] % x);//减去剩的就是要添加的
	}return 0;
}