René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/sort-list","name":"#148 - Sort List - LeetCode JavaScript Solutions","description":"Given the head of a linked list, return the list after sorting it in ascending order. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n *     this.val = (val===undefined ? 0 : val)\n *     this.next = (next===undefined ? null : next)\n * }\n */\n/**\n * @param {ListNode} head\n * @return {ListNode}\n */\nvar sortList = function(head) {\n  if (!head || !head.next) return head;\n  let fast = head;\n  let slow = head;\n  while (fast.next && fast.next.next) {\n    fast = fast.next.next;\n    slow = slow.next;\n  }\n  const middle = slow.next;\n  slow.next = null;\n  return mergeList(sortList(head), sortList(middle));\n};\n\nfunction mergeList(a, b) {\n  const ordered = new ListNode(-1);\n  let list = ordered;\n\n  while (a && b) {\n    list.next = a.val < b.val ? a : b;\n    list = list.next;\n    if (a.val < b.val) {\n      a = a.next;\n    } else {\n      b = b.next;\n    }\n  }\n\n  list.next = a ?? b;\n  return ordered.next;\n}","keywords":"LeetCode 148, #148 - Sort List, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}