As a result of the ingenuity of memory structure,its complexity of the time can be linear time N in the best situation and that is O(N2)in the worst case.

• 由于存储结构的巧妙性；算法的时间复杂度在最好的情况下为线性时间N；在最坏的情况下为O(N2).