Your name is very interesting! But I also want to answer your question because you are interesting in this topic and you know something about it! This list is a sequence list.
【在 b*******n 的大作中提到】 : : how do you know it is at the end of list?
p*n
5 楼
每次查询后,把命中的换到最前面来,这样就能适当优化下。
r*e
6 楼
感谢回复中提到的方法: 每次查询后,把命中的换到最前面来,这样就能适当优化下。
I*s
7 楼
skip list?
I*s
8 楼
Several operations for a self-organized linked list: for the found node, 1) move it to the front, 2) swap with the node in front of it, or 3) adjust its location according to the access frequency.