GoLang Solution For LeetCode Problem: Reverse Linked List II
Solving Reverse Linked List II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Reverse a linked list from position m to n. Do it in one-pass.
Input: 1->2->3->4->5->NULL, m = 2, n = 4 Output: 1->4->3->2->5->NULL
See the full details of the problem Reverse Linked List II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go