LinkedHashMap 的实现与 HashMap 有何不同?

How is the implementation of LinkedHashMap different from HashMap?(LinkedHashMap 的实现与 HashMap 有何不同?)

问题描述

如果 LinkedHashMap 的时间复杂度和 HashMap 的复杂度一样，为什么我们需要 HashMap?与 Java 中的 HashMap 相比，LinkedHashMap 的额外开销是多少?

If LinkedHashMap's time complexity is same as HashMap's complexity why do we need HashMap? What are all the extra overhead LinkedHashMap has when compared to HashMap in Java?

推荐答案

LinkedHashMap 会占用更多内存.普通 HashMap 中的每个条目都只有键和值.每个LinkedHashMap 条目都有那些引用和 对下一个和前一个条目的引用.还有一点点家务要做，虽然这通常无关紧要.

LinkedHashMap will take more memory. Each entry in a normal HashMap just has the key and the value. Each LinkedHashMap entry has those references and references to the next and previous entries. There's also a little bit more housekeeping to do, although that's usually irrelevant.

这篇关于LinkedHashMap 的实现与 HashMap 有何不同?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持编程学习网！