摘要:leetcode algorithms 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 may not modify the valu
阅读全文
摘要:leetcode algorithms 142 Linked List Cycle II Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To repres
阅读全文
摘要:leetcode algorithms 141. Linked List Cycle Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we u
阅读全文
摘要:leetcode algorithms 109. Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted in ascending order, convert it
阅读全文
摘要:leetcode algorithms 92. Reverse Linked List II Reverse a linked list from position m to n. Do it in one pass. Note: 1 ≤ m ≤ n ≤ length of list. Exampl
阅读全文