LinkedHashSet - 插入顺序和重复 - 保持最新“在顶部”

I need a collection that keeps insertion order and has unique values. LinkedHashSet looks like the way to go, but there's one problem - when two items are equal, it removes the newest one (which makes sense), here's an example:I need a collection that keeps insertion order