Skip to content

Commit 8dc9018

Browse files
authored
2025-03-14 v. 8.9.8: added "2095. Delete the Middle Node of a Linked List"
2 parents 6187669 + 772f64d commit 8dc9018

4 files changed

+77
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -731,6 +731,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
731731
| 2063. Vowels of All Substrings | [Link](https://leetcode.com/problems/vowels-of-all-substrings/) | [Link](./lib/medium/2063_vowels_of_all_substrings.rb) | [Link](./test/medium/test_2063_vowels_of_all_substrings.rb) |
732732
| 2074. Reverse Nodes in Even Length Groups | [Link](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/) | [Link](./lib/medium/2074_reverse_nodes_in_even_length_groups.rb) | [Link](./test/medium/test_2074_reverse_nodes_in_even_length_groups.rb) |
733733
| 2091. Removing Minimum and Maximum From Array | [Link](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/) | [Link](./lib/medium/2091_removing_minimum_and_maximum_from_array.rb) | [Link](./test/medium/test_2091_removing_minimum_and_maximum_from_array.rb) |
734+
| 2095. Delete the Middle Node of a Linked List | [Link](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/) | [Link](./lib/medium/2095_delete_the_middle_node_of_a_linked_list.rb) | [Link](./test/medium/test_2095_delete_the_middle_node_of_a_linked_list.rb) |
734735
| 2116. Check if a Parentheses String Can Be Valid | [Link](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/) | [Link](./lib/medium/2116_check_if_a_parentheses_string_can_be_valid.rb) | [Link](./test/medium/test_2116_check_if_a_parentheses_string_can_be_valid.rb) |
735736
| 2425. Bitwise XOR of All Pairings | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/) | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb) | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb) |
736737
| 2429. Minimize XOR | [Link](https://leetcode.com/problems/minimize-xor/) | [Link](./lib/medium/2429_minimize_xor.rb) | [Link](./test/medium/test_2429_minimize_xor.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 = '8.9.7'
8+
s.version = '8.9.8'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'
Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
# frozen_string_literal: true
2+
3+
# https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/
4+
# @param {ListNode} head
5+
# @return {ListNode}
6+
def delete_middle(head)
7+
prev = nil
8+
slow = head
9+
fast = head
10+
11+
while fast&.next
12+
prev = slow
13+
slow = slow.next
14+
fast = fast.next.next
15+
end
16+
17+
return unless prev
18+
19+
prev.next = slow.next
20+
21+
head
22+
end
Lines changed: 53 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,53 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/common/linked_list'
5+
require_relative '../../lib/medium/2095_delete_the_middle_node_of_a_linked_list'
6+
require 'minitest/autorun'
7+
8+
class DeleteTheMiddleNodeOfALinkedListTest < ::Minitest::Test
9+
def test_default_one
10+
assert(
11+
::ListNode.are_equals(
12+
::ListNode.from_array(
13+
[1, 3, 4, 1, 2, 6]
14+
),
15+
delete_middle(
16+
::ListNode.from_array(
17+
[1, 3, 4, 7, 1, 2, 6]
18+
)
19+
)
20+
)
21+
)
22+
end
23+
24+
def test_default_two
25+
assert(
26+
::ListNode.are_equals(
27+
::ListNode.from_array(
28+
[1, 2, 4]
29+
),
30+
delete_middle(
31+
::ListNode.from_array(
32+
[1, 2, 3, 4]
33+
)
34+
)
35+
)
36+
)
37+
end
38+
39+
def test_default_three
40+
assert(
41+
::ListNode.are_equals(
42+
::ListNode.from_array(
43+
[2]
44+
),
45+
delete_middle(
46+
::ListNode.from_array(
47+
[2, 1]
48+
)
49+
)
50+
)
51+
)
52+
end
53+
end

0 commit comments

Comments
 (0)