Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 11052 | Accepted: 4686 |
Description
Input
Output
Sample Input
carbohydrate cart carburetor caramel caribou carbonic cartilage carbon carriage carton car carbonate
Sample Output
carbohydrate carboh cart cart carburetor carbu caramel cara caribou cari carbonic carboni cartilage carti carbon carbon carriage carr carton carto car car carbonate carbona
题目大意:给出一组字符串,求出每个字符串的最短的而且唯一的前缀,如果该字符串是其它字符串的前缀,则输出该字符串。
#include <stdio.h> #include <iostream> #include <stdlib.h> #include <string.h> using namespace std; char str[1001][21]; typedef struct node { int times; bool bend; node *next[26]; node() { for (int i = 0; i < 26; i++) { next[i] = NULL; } times = 1; bend = false; } }TreeNode; void Insert(char str[], TreeNode *pHead) { int nLen = strlen(str); TreeNode *p = pHead; for (int i = 0; i < nLen; i++) { if (p->next[str[i] - 'a'] == NULL) { p->next[str[i] - 'a'] = new TreeNode; } else { p->next[str[i] - 'a']->times++; } p = p->next[str[i] - 'a']; } p->bend = true; } void Search(char str[], TreeNode *pHead) { int nLen = strlen(str); TreeNode *p = pHead; for(int i = 0; i < nLen; i++) { if ((p->next[str[i] - 'a']->bend && i == nLen - 1)|| p->next[str[i] - 'a']->times == 1) { printf("%c\n", str[i]); break; } printf("%c", str[i]); p = p->next[str[i] - 'a']; } } void Delete(TreeNode *pHead) { for (int i = 0; i < 26; i++) { if (pHead->next[i] != NULL) { Delete(pHead->next[i]); } } delete pHead; } int main() { int nCount = -1; TreeNode *pHead = new TreeNode; while(scanf("%s", str[++nCount]) != EOF) { Insert(str[nCount], pHead); } for (int i = 0; i <= nCount; i++) { printf("%s ", str[i]); Search(str[i], pHead); } Delete(pHead); return 0; }