Cyclic Nacklace（KMP-next数组应用+循环字符串判断）

Cyclic Nacklace( HDU - 3746 )

目录

Cyclic Nacklace( HDU - 3746 )

题意描述

解题思路

易错分析

AC代码

---

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.

CC这个月底总是很郁闷，昨天查了一下信用卡，不出意外，只剩下99.9元了。他太心疼了，想着如何度过最后的日子。受到“HDU CakeMan”创业精神的启发，他想卖一些小东西来赚钱。当然，这不是一件容易的事。

圣诞节快到了，男孩们忙着挑选圣诞礼物送给他们的女朋友。相信链式手链是一个不错的选择。然而，事情并不总是那么简单，众所周知，女孩喜欢用五颜六色的装饰来让手链显得生动活泼，同时也想展现自己作为大学生成熟的一面。CC了解女孩的诉求后，打算出售名为CharmBracelet的链式手链。CharmBracelet由色彩缤纷的珍珠组成，展现出少女的活泼，最重要的是它必须由一条循环链连接，这意味着珍珠的颜色是从左到右循环连接的。并且循环计数必须大于一。如果你把这条链子最左边的珍珠和最右边的珍珠连接起来，你可以做一个CharmBracelet。就像下图，这个 CharmBracelet 的周期是 9，它的周期数是 2：
现在CC带来了一些普通的手链链，他想购买最少数量的珍珠来制作CharmBracelets，这样他就可以节省更多的钱。但在改造手链时，他只能在链的左端和右端添加彩色珍珠，也就是说，在中间添加是被禁止的。
CC 对他的想法很满意，向您寻求帮助。

输入

输入的第一行是一个整数 T ( 0 < T <= 100 )，表示测试用例的数量。
每个测试用例只包含一行描述要重新制作的原始普通链。字符串中的每个字符代表一颗珍珠，用'a'~'z'字符描述了26种珍珠。字符串 Len 的长度：（ 3 <= Len <= 100000 ）。

输出

对于每种情况，您都需要输出为制作 CharmBracelet 添加的最小珍珠数。

Sample Input

3
aaa
abca
abcde

Sample Output

0
2
5

题意描述：给n组字符串，求还需要多少个字符使该字符串变成循环周期大于1的循环字符串。

解题思路：利用next数组，如果给的字符串的最长字符串的前后缀相同长度为0，直接输出字符串长度即满足题目的周期大于1；如果有相同的串，分两种情况，利用公式判断该串是否本身就是循环子串，如果是输出0；如果不是的话，先求最小循环节（长度减它的next值），然后求字符串本身除了最小循环节多出了几个字符。然后拿最小循环节减多出来的即为结果。

易错分析：上面的最后一种情况，当时是用长度减2倍的字符串next前后缀相同值，考虑是是abcdab情况，没有考虑到abcdabcdab情况（这个时候输出负值）

AC代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
int ne[100500];
char str[100500];
int a;
using namespace std;
void getnext()
{
	int j=0,k=-1;
	ne[0]=-1;
	while(j<a)
	{
		if(k==-1||str[j]==str[k])
		{
			k++;
			j++;
			ne[j]=k;
			//printf("%d",ne[j]);
		}
		else
			k=ne[k];
	}
}
int main(void)
{
	int t;
	cin>>t;
	while(t--)
	{
		//memset(str,0,sizeof(str));
		scanf("%s",str);
		a=strlen(str);
		getnext();
		int b=ne[a];
		int r=a-b;//r为最小循环串
		if(b==0)//没有相同的 a、abc情况输出长度 
		{
			printf("%d\n",a);
			//continue; 
		}
		 
		else//有相同的 
		{
			if(a%(a-b)==0) //已经有循环了 abab情况
			{
					printf("0\n");
			} 
			else//abcabcab情况 
			//	不能printf("%d\n",a-2*b);
				printf("%d\n",r-a%r;
		}
		
	}
	return 0;
}