Skip to content

Commit d31894a

Browse files
authored
Merge pull request #720 from fartem/147_Insertion_Sort_List
2024-08-26 v. 6.5.5: updated test file for "147. Insertion Sort List"
2 parents 1eeb408 + 6ae89a3 commit d31894a

File tree

4 files changed

+64
-1
lines changed

4 files changed

+64
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -520,3 +520,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
520520
| 142. Linked List Cycle II | [Link](https://leetcode.com/problems/linked-list-cycle-ii/) | [Link](./lib/medium/142_linked_list_cycle_ii.rb) | [Link](./test/medium/test_142_linked_list_cycle_ii.rb) |
521521
| 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) |
522522
| 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) |
523+
| 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) |

leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ require 'English'
55
::Gem::Specification.new do |s|
66
s.required_ruby_version = '>= 3.0'
77
s.name = 'leetcode-ruby'
8-
s.version = '6.5.4'
8+
s.version = '6.5.5'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'

lib/medium/147_insertion_sort_list.rb

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../common/linked_list'
4+
5+
# https://leetcode.com/problems/insertion-sort-list/
6+
# @param {ListNode} head
7+
# @return {ListNode}
8+
def insertion_sort_list(head)
9+
result = ::ListNode.new
10+
curr = head
11+
12+
while curr
13+
prev = result
14+
15+
prev = prev.next while prev.next && prev.next.val <= curr.val
16+
17+
nxt = curr.next
18+
curr.next = prev.next
19+
prev.next = curr
20+
curr = nxt
21+
end
22+
23+
result.next
24+
end
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/common/linked_list'
5+
require_relative '../../lib/medium/147_insertion_sort_list'
6+
require 'minitest/autorun'
7+
8+
class InsertionSortListTest < ::Minitest::Test
9+
def test_default_one
10+
assert(
11+
::ListNode.are_equals(
12+
::ListNode.from_array(
13+
[1, 2, 3, 4]
14+
),
15+
insertion_sort_list(
16+
::ListNode.from_array(
17+
[4, 2, 1, 3]
18+
)
19+
)
20+
)
21+
)
22+
end
23+
24+
def test_default_two
25+
assert(
26+
::ListNode.are_equals(
27+
::ListNode.from_array(
28+
[-1, 0, 3, 4, 5]
29+
),
30+
insertion_sort_list(
31+
::ListNode.from_array(
32+
[-1, 5, 3, 4, 0]
33+
)
34+
)
35+
)
36+
)
37+
end
38+
end

0 commit comments

Comments
 (0)