class LNode{
T Data
LNode next
}
class MyLinkList{
Node head
addFirst(LNode node)
addLast(LNode node)
insertAfter(LNode node)
insertBefore(LNode node)
findByIndex(int index)
deleteFirst()
deleteLast()
deleteIndex(int index)
deleteNode(LNode node)
}
- 找中间节点
- 是否有环
- 环的开始
思路

- 删除链表第K个尾节点
- 合并两个排序链表
- 繁杂写法
- 简洁写法
- 递归写法
- Intersetion of Two Linked lists(交叉链表)
- Insertion Sort List(插入排序链表)
- Sort List(归并)
- Partition List
- Reverse a Linked List
- Reverse a Linked List II
- Reverse a Linked List III
- Reverse a Linked List IV
- Palindrome Linked List
- Remove Duplications from Sorted List