The size of the double-array structure would be n + cm, where c is a coefficient which is dependent on the characteristic of the trie. And the time complexity of the brute force algorithm would be O(nm + cm2). 假设在trie中有n个结点,字母集的大小为m。双数组结构的大小为n+cm,其中c是...