算法题:链表深拷贝
题目描述
Given a singly linked list L: L 0→L 1→…→L n-1→L n,
reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…
You must do this in-place without altering the nodes’ values.
For example,
Given{1,2,3,4}
reorder ...
原创
2019-05-30 23:39:42 ·
197 阅读 ·
0 评论