题目 A prefix of a string is a substring starting at the beginning of the given string. The prefixes of “carbon” are: “c”, “ca”, “car”, “carb”, “carbo”, and “carbon”. Note that the empty string is not considered a prefix in this problem, but every non-empty string is considered to be a prefix of itself. In everyday language, we tend to abbreviate words by prefixes. For example, “carbohydrate” is commonly abbreviated by “carb”. In this problem, given a set of words, you will find for each word the shortest prefix that uniquely identifies the word it represents.
In the sample input below, “carbohydrate” can be abbreviated to “carboh”, but it cannot be abbreviated to “carbo” (or anything shorter) because there are other words in the list that begin with “carbo”.
An exact match will override a prefix match. For example, the prefix “car” matches the given word “car” exactly. Therefore, it is understood without ambiguity that “car” is an abbreviation for “car” , not for “carriage” or any of the other words in the list that begins with “car”.
Input The input contains at least two, but no more than 1000 lines. Each line contains one word consisting of 1 to 20 lower case letters. Output
The output contains the same number of lines as the input. Each line of the output contains the word from the corresponding line of the input, followed by one blank space, and the shortest prefix that uniquely (without ambiguity) identifies this word.
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
这个题目比较简单，看题的第一感觉就是用字典树 那就写一个呗 由于对空间要求不是太严格，所以可以用数组减少工作量（浪费一点内存而已）
AC代码
#include<iostream> #include<string> #include<vector> using namespace std; class Trietree { private: Trietree *next[26]; int a; public: Trietree() { for (int i = 0; i < 26; i++) { next[i] = NULL; a = 0; } } void insertword(string & s) { Trietree *p = this; for (int i = 0; s[i] != '\0'; i++) { if (p->next[s[i] - 'a'] == NULL) { p->next[s[i] - 'a'] = new Trietree; } p->next[s[i] - 'a']->a++; p = p->next[s[i] - 'a']; } } bool search(string & s) { Trietree *p = this; for (int i = 0; i < s.length(); i++) { if (p->next[s[i] - 'a'] == NULL) return false; p = p->next[s[i] - 'a']; } return true; } void outmin(string & s) { Trietree *p=this; for (int i = 0; i < s.length(); i++) { cout << s[i]; int flag = 0; for (int j = 0; j < 26; j++) { if (p->next[s[i] - 'a']->next[j] != NULL) flag++; } if (flag == 1&&p->next[s[i] - 'a']->a==1||flag==0) return; p = p->next[s[i] - 'a']; } } }; int main() { vector<string> a; string t; Trietree k; while (cin >> t) { a.push_back(t); } for (int i = 0; i < a.size(); i++) { k.insertword(a[i]); } for (int i = 0; i < a.size(); i++) { cout << a[i]<<' '; k.outmin(a[i]); cout << endl; } system("pause"); return 0; }