算法时间复杂度对比图

Name Insert Access Search Delete Comments Array O(n) O(1) O(n) O(n) Insertion to the end is O(1). Details here. (Hash)Map O(1)* O(1)* O(1)* O(1)* Rehashing might affect insertion time. Details here. M

>>阅读原文<<