说明：  给定一本字典dict和一段文本text，现在要统计文本text中不在字典dict中的单词，且希望找到text 中出现次数最多的不在字典dict 中的单词。 设计并实现解字典问题的O(nlog n)时间算法，对于给定的字典dict和文本text，找出text中出现次 数最多的不在字典dict中的单词。
(Given a dictionary and a dict text text, text text now in the statistics is not the word in the dictionary dict, and the hope of finding a maximum number of text appear in the dict dictionary is not the word. Dictionary is designed and implemented the issue of solution O (nlog n) time algorithm, for a given dict dictionary and text text, identify the number of text appear in the dict dictionary is not the word.)