摘要：
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 @ 2017-02-20 13:01
lettuan
阅读(126)
评论(0)
推荐(0)
摘要：
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy 阅读全文
posted @ 2017-02-20 10:18
lettuan
阅读(165)
评论(0)
推荐(0)
摘要：
思路： 阅读全文
posted @ 2017-02-20 06:39
lettuan
阅读(159)
评论(0)
推荐(0)
浙公网安备 33010602011771号