所在目录:
教材与参考资料 / 程序设计类 / 数据结构＆算法 / 算法 / 面试与力扣题目详解 / Leetcode题目和解答 / java-leetcode / sort-list
下载地址:
文本预览:
## MergeSort
* cut in the middle
* MergeSort(left) and MegerSort(right)
* merge using [Merge Two Sorted Lists](../merge-two-sorted-lists)
### Finding the middle of a linked list
fast-slow pointer.
1. fast runner goes 2 steps each time
1. slow runner goes 1 step
1. when fast reach the end of the linked list, the slow id the middle of the list
点赞
回复
