1. LinkedList
1) Build the list
2) Sort the list
3) Look up some item in the list
4) Insertion and deletion in the list
5) Reverse the list
6) Jouseph problem
We shouldn't limit our selves to only move one single step by using x = x->next. We can move severals steps once a time.
There's some triky while moving in looping linked list since you need to know the concret steps to move each time. You need counting.
7) Find the circle in the list
8) Join two sorted list/ Join two list and sort them
2. Stack
1) Build a stack with array
2) Build a stack with linked list
3) Get the minimum item in O(1)
4) Sort the stack
5)
标签：随笔,some,move,list,算法,Build,need,数据结构,stack From： https://www.cnblogs.com/sysmman/p/18325201