2024-08-27 v. 6.5.6: added "148. Sort List"

Author: fartem

README.md

@@ -521,3 +521,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 143. Reorder List                                               | [Link](https://leetcode.com/problems/reorder-list/)                                               | [Link](./lib/medium/143_reorder_list.rb)                                               | [Link](./test/medium/test_143_reorder_list.rb)                                               |
 | 146. LRU Cache                                                  | [Link](https://leetcode.com/problems/lru-cache/)                                                  | [Link](./lib/medium/146_lru_cache.rb)                                                  | [Link](./test/medium/test_146_lru_cache.rb)                                                  |
 | 147. Insertion Sort List                                        | [Link](https://leetcode.com/problems/insertion-sort-list/)                                        | [Link](./lib/medium/147_insertion_sort_list.rb)                                        | [Link](./test/medium/test_147_insertion_sort_list.rb)                                        |
+| 148. Sort List                                                  | [Link](https://leetcode.com/problems/sort-list/)                                                  | [Link](./lib/medium/148_sort_list.rb)                                                  | [Link](./test/medium/test_148_sort_list.rb)                                                  |

leetcode-ruby.gemspec

@@ -5,7 +5,7 @@ require 'English'
 ::Gem::Specification.new do |s|
   s.required_ruby_version = '>= 3.0'
   s.name = 'leetcode-ruby'
-  s.version = '6.5.5.1'
+  s.version = '6.5.6'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/148_sort_list.rb

@@ -0,0 +1,52 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/sort-list/
+# @param {ListNode} head
+# @return {ListNode}
+def sort_list(head)
+  return head if head.nil? || head.next.nil?
+
+  temp = head
+  slow = head
+  fast = head
+
+  while fast&.next
+    temp = slow
+    slow = slow.next
+    fast = fast.next.next
+  end
+
+  temp.next = nil
+
+  left = sort_list(head)
+  right = sort_list(slow)
+
+  merge_nodes(left, right)
+end
+
+private
+
+# @param {ListNode} left
+# @param {ListNode} right
+# @return {ListNode}
+def merge_nodes(left, right)
+  temp = ::ListNode.new(0)
+  curr = temp
+
+  while left && right
+    if left.val < right.val
+      curr.next = left
+      left = left.next
+    else
+      curr.next = right
+      right = right.next
+    end
+
+    curr = curr.next
+  end
+
+  curr.next = left if left
+  curr.next = right if right
+
+  temp.next
+end

test/medium/test_148_sort_list.rb

@@ -0,0 +1,38 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/linked_list'
+require_relative '../../lib/medium/148_sort_list'
+require 'minitest/autorun'
+
+class SortListTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      ::ListNode.are_equals(
+        ::ListNode.from_array(
+          [1, 2, 3, 4]
+        ),
+        sort_list(
+          ::ListNode.from_array(
+            [4, 2, 1, 3]
+          )
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert(
+      ::ListNode.are_equals(
+        ::ListNode.from_array(
+          [-1, 0, 3, 4, 5]
+        ),
+        sort_list(
+          ::ListNode.from_array(
+            [-1, 5, 3, 4, 0]
+          )
+        )
+      )
+    )
+  end
+end