[Go] Solution
Runtime: 8 ms, faster than 92.81% of Go online submissions for Reorder List.\nMemory Usage: 5.4 MB, less than 50.00% of Go online submissions for Reorder List.\
Runtime: 8 ms, faster than 92.81% of Go online submissions for Reorder List.\nMemory Usage: 5.4 MB, less than 50.00% of Go online submissions for Reorder List.\n```\n/**\n * Definition for singly-linked list.\n * type ListNode struct {\n *     Val int\n *     Next *ListNode\n * }\n */\nfunc reorderList(head *ListNode)  {\n    if head == nil || head.Next == nil {\n        return\n    }\n    \n    slow, fast := head, head\n    for fast != nil && fast.Next != nil {\n        slow, fast = slow.Next, fast.Next.Next\n    }\n    \n    var prev *ListNode\n    for slow != nil {\n        slow.Next, prev, slow = prev, slow, slow.Next\n    }\n    \n\n    first := head\n    for prev.Next != nil{\n        first.Next, first = prev, first.Next\n        prev.Next, prev = first, prev.Next\n    }\n}\n```
['Go']