reorder list(链表重新排序)
摘要:
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. For 阅读全文
posted @ 2018-01-17 16:32 夜的第八章 阅读(150) 评论(0) 推荐(0) 编辑