- 博客(4)
- 收藏
- 关注
RSS订阅原创 【LeetCode】 143. 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 example, Given {1,2,3,4}, reorder it to {1,4
2017-02-12 00:13:42
214
原创 【LeetCode】 142. Linked List Cycle 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?
2017-02-11 23:45:52
209
原创 【LeetCode】 092. Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given m, n satisfy the
2017-02-11 23:44:50
179
原创 【LeetCode】 082. Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4->5, return 1->2->5. Given 1->1-
2017-02-11 23:43:12
229
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人