查重字串

for(i = 0; str[i] != '\0'; i++)
{
	record[str[i]]++;//記錄出現次數
	if(1 == jilu[str[i]])
	{
		result[num++] = str[i];//輸出不重複項
	}
}

• 將26字母剩餘部分拼接
  

for(assic = 'A'; assic <= 'Z'; assic++)
{
	flag = 0;
	for(j = 0; j < num; j++)
	{
	if(assic == result[j])
	{
		flag = 1;//標誌為重複
		break;
	}
	}
	if(flag == 0)
	{
		result[n++] = assic;//拼接到後面
	}
}

• 巧妙拼接

char c = 'A';
for(c; c <= 'Z';c++)
{
	if(0 == jilu[c])
	{
		perfect[n++] = c;
	}
}