一道Topcoder Algorithms 550分的题

(我自己实现的代码在另外一篇文章) 

Problem Statement
    
Two words are said to be anagrams if one word can be formed by rearranging the letters of the other word. For example, "AABC" and "CABA" are anagrams.
You will be given two strings, word1 and word2, representing two words. These two strings will contain only uppercase letters ('A'-'Z') and '.' characters which denote missing letters. Replace the '.' characters with uppercase letters such that the two words become anagrams and return the result as a vector <string> containing exactly two elements. The first element should correspond to word1 and the second element should correspond to word2. If there are multiple possible return values, choose the one in which the first element comes first alphabetically. If ties still exist, choose the one among them in which the second element comes first alphabetically. If it is impossible to make the two words into anagrams, return an empty vector <string>. Note that two equal words are considered anagrams.
Definition
    
Class:                                   AnagramCompletion
Method:                                complete
Parameters:                        string, string
Returns:                               vector <string>
Method signature:              vector <string> complete(string word1, string word2)
(be sure your method is public)
    

Constraints
-
word1 will contain between 1 and 50 characters, inclusive.
-
word2 will contain the same number of characters as word1.
-
word1 and word2 will contain only uppercase letters ('A'-'Z') and '.' characters.
-
There will be at least one '.' in at least one of the two words.

Examples
0)
"AB.AC."
"ABD..E"
Returns: {"ABDACE", "ABDACE" }
The letters 'D' and 'E' appear in the second word but not in the first one, so we place them in the two empty spots. Similarly the letter 'C' must be present in the second word. The letter 'A' must appear a second time in the second word. Ties are broken alphabetically.

1)
"ABC..."
"DEF..."
Returns: {"ABCDEF", "DEFABC" }

2)
"......"
"......"
Returns: {"AAAAAA", "AAAAAA" }
All the letters are missing, so we can replace them all with the letter 'A'.

3) 
"TOPCODER"
"D.E..TR."
Returns: {"TOPCODER", "DCEOOTRP" }

4)
"ABC."
"DEF."
Returns: { }
Each word is missing three letters from the other word, but there is only one empty spot in each of them.

5)
"TEFAT..PVSKKJT.QBJEB..NPN..NBL"
"...B...E.ND.LNE...HW.ANTB.TKBD"
Returns: {"TEFATAAPVSKKJTAQBJEBDDNPNHWNBL", "AAABFJJEKNDPLNEPQSHWTANTBVTKBD" }

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.