- 博客(3)
- 收藏
- 关注
RSS订阅
10原创 LeetCode143 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 may not modify the values in the list's nodes, only nodes itself may be changed.Example 1:Given 1->2-...
2018-09-08 17:05:09
107
原创 LeetCode142 Linked List Cycle II 链表循环II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up:Can you solve it without using extra space?题源：here；完...
2018-09-01 19:35:55
102
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人