Skip to content

Commit e7697a7

Browse files
authored
2025-03-25 v. 9.1.0: added "2181. Merge Nodes in Between Zeros"
2 parents 821382c + 78f8697 commit e7697a7

File tree

4 files changed

+66
-1
lines changed

4 files changed

+66
-1
lines changed

README.md

+1
Original file line numberDiff line numberDiff line change
@@ -744,6 +744,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
744744
| 2161. Partition Array According to Given Pivot | [Link](https://leetcode.com/problems/partition-array-according-to-given-pivot/) | [Link](./lib/medium/2161_partition_array_according_to_given_pivot.rb) | [Link](./test/medium/test_2161_partition_array_according_to_given_pivot.rb) |
745745
| 2165. Smallest Value of the Rearranged Number | [Link](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/) | [Link](./lib/medium/2165_smallest_value_of_the_rearranged_number.rb) | [Link](./test/medium/test_2165_smallest_value_of_the_rearranged_number.rb) |
746746
| 2177. Find Three Consecutive Integers That Sum to a Given Number | [Link](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/) | [Link](./lib/medium/2177_find_three_consecutive_integers_that_sum_to_a_given_number.rb) | [Link](./test/medium/test_2177_find_three_consecutive_integers_that_sum_to_a_given_number.rb) |
747+
| 2181. Merge Nodes in Between Zeros | [Link](https://leetcode.com/problems/merge-nodes-in-between-zeros/) | [Link](./lib/medium/2181_merge_nodes_in_between_zeros.rb) | [Link](./test/medium/test_2181_merge_nodes_in_between_zeros.rb) |
747748
| 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) |
748749
| 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) |
749750
| 2657. Find the Prefix Common Array of Two Arrays | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | [Link](./lib/medium/2657_find_the_prefix_common_array_of_two_arrays.rb) | [Link](./test/medium/test_2657_find_the_prefix_common_array_of_two_arrays.rb) |

leetcode-ruby.gemspec

+1-1
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 = '9.0.9'
8+
s.version = '9.1.0'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
# frozen_string_literal: true
2+
3+
# https://leetcode.com/problems/merge-nodes-in-between-zeros/
4+
# @param {ListNode} head
5+
# @return {ListNode}
6+
def merge_nodes2181(head)
7+
r_p = head.next
8+
p_p = head.next.next
9+
10+
while p_p.next
11+
if p_p.val.zero?
12+
r_p.next = p_p.next
13+
r_p = r_p.next
14+
p_p = p_p.next
15+
else
16+
r_p.val += p_p.val
17+
end
18+
19+
p_p = p_p.next
20+
end
21+
22+
r_p.val += p_p.val
23+
r_p.next = nil
24+
25+
head.next
26+
end
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/2181_merge_nodes_in_between_zeros'
6+
require 'minitest/autorun'
7+
8+
class MergeNodesInBetweenZerosTest < ::Minitest::Test
9+
def test_default_one
10+
assert(
11+
::ListNode.are_equals(
12+
::ListNode.from_array(
13+
[4, 11]
14+
),
15+
merge_nodes2181(
16+
::ListNode.from_array(
17+
[0, 3, 1, 0, 4, 5, 2, 0]
18+
)
19+
)
20+
)
21+
)
22+
end
23+
24+
def test_default_two
25+
assert(
26+
::ListNode.are_equals(
27+
::ListNode.from_array(
28+
[1, 3, 4]
29+
),
30+
merge_nodes2181(
31+
::ListNode.from_array(
32+
[0, 1, 0, 3, 0, 2, 2, 0]
33+
)
34+
)
35+
)
36+
)
37+
end
38+
end

0 commit comments

Comments
 (0)