HolyDominat的专栏

Sort a linked list in O(n log n) time using constant space complexity. Solution: Merge Sort

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 

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? Solution: Code: /** * Definition for singly-linked list. * struct ListNode

Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space? Solution: Code: /** * Definition fo

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. Solution: Code: