Skip to content

2025-01-23 v. 8.2.5.2: updated TreeNode initialization for tests #905

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 23, 2025
Merged

2025-01-23 v. 8.2.5.2: updated TreeNode initialization for tests #905

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion leetcode-ruby.gemspec
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ require 'English'
::Gem::Specification.new do |s|
s.required_ruby_version = '>= 3.0'
s.name = 'leetcode-ruby'
s.version = '8.2.5.1'
s.version = '8.2.5.2'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
8 changes: 3 additions & 5 deletions lib/medium/129_sum_root_to_leaf_numbers.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,21 +3,19 @@
# https://leetcode.com/problems/sum-root-to-leaf-numbers/
# @param {TreeNode} root
# @return {Integer}
def sum_numbers(root)
sum129(root, 0)
end
def sum_numbers(root) = sum_for_root_to_leaf_number(root, 0)

private

# @param {TreeNode} node
# @param {Integer} curr
# @return {Integer}
def sum129(node, curr)
def sum_for_root_to_leaf_number(node, curr)
return 0 unless node

curr = curr * 10 + node.val

return curr if node.left.nil? && node.right.nil?

sum129(node.left, curr) + sum129(node.right, curr)
sum_for_root_to_leaf_number(node.left, curr) + sum_for_root_to_leaf_number(node.right, curr)
end
16 changes: 4 additions & 12 deletions test/medium/test_129_sum_root_to_leaf_numbers.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,10 +10,8 @@ def test_default_one
assert_equal(
25,
sum_numbers(
::TreeNode.new(
1,
::TreeNode.new(2),
::TreeNode.new(3)
::TreeNode.build_tree(
[1, 2, 3]
)
)
)
Expand All @@ -23,14 +21,8 @@ def test_default_two
assert_equal(
1026,
sum_numbers(
::TreeNode.new(
4,
::TreeNode.new(
9,
::TreeNode.new(5),
::TreeNode.new(1)
),
::TreeNode.new(0)
::TreeNode.build_tree(
[4, 9, 0, 5, 1]
)
)
)
Expand Down
10 changes: 2 additions & 8 deletions test/medium/test_173_binary_search_tree_iterator.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,14 +8,8 @@
class BinarySearchTreeIndicatorTest < ::Minitest::Test
def test_default_one
bst_iterator = ::BSTIterator.new(
::TreeNode.new(
7,
::TreeNode.new(3),
::TreeNode.new(
15,
::TreeNode.new(9),
::TreeNode.new(20)
)
::TreeNode.build_tree(
[7, 3, 15, nil, nil, 9, 20]
)
)

Expand Down
33 changes: 16 additions & 17 deletions test/medium/test_199_binary_tree_right_side_view.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,37 +10,36 @@ def test_default_one
assert_equal(
[1, 3, 4],
right_side_view(
::TreeNode.new(
1,
::TreeNode.new(
2,
nil,
::TreeNode.new(5)
),
::TreeNode.new(
3,
nil,
::TreeNode.new(4)
)
::TreeNode.build_tree(
[1, 2, 3, nil, 5, nil, 4]
)
)
)
end

def test_default_two
assert_equal(
[1, 3],
[1, 3, 4, 5],
right_side_view(
::TreeNode.new(
1,
nil,
::TreeNode.new(3)
::TreeNode.build_tree(
[1, 2, 3, 4, nil, nil, nil, 5]
)
)
)
end

def test_default_three
assert_equal(
[1, 3],
right_side_view(
::TreeNode.build_tree(
[1, nil, 3]
)
)
)
end

def test_default_four
assert_equal(
[],
right_side_view(nil)
Expand Down
24 changes: 4 additions & 20 deletions test/medium/test_230_kth_smallest_element_in_a_bst.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,14 +10,8 @@ def test_default_one
assert_equal(
1,
kth_smallest(
::TreeNode.new(
3,
::TreeNode.new(
1,
nil,
::TreeNode.new(2)
),
::TreeNode.new(4)
::TreeNode.build_tree(
[3, 1, 4, nil, 2]
),
1
)
Expand All @@ -28,18 +22,8 @@ def test_default_two
assert_equal(
3,
kth_smallest(
::TreeNode.new(
5,
::TreeNode.new(
3,
::TreeNode.new(
2,
::TreeNode.new(1),
nil
),
::TreeNode.new(4)
),
::TreeNode.new(6)
::TreeNode.build_tree(
[5, 3, 6, 2, 4, nil, nil, 1]
),
3
)
Expand Down
92 changes: 32 additions & 60 deletions test/medium/test_235_lowest_common_ancestor_of_a_binary_search_tree.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,25 +10,15 @@ def test_default_one
assert_equal(
6,
lowest_common_ancestor(
::TreeNode.new(
6,
::TreeNode.new(
2,
::TreeNode.new(0),
::TreeNode.new(
4,
::TreeNode.new(3),
::TreeNode.new(5)
)
),
::TreeNode.new(
8,
::TreeNode.new(7),
::TreeNode.new(9)
)
::TreeNode.build_tree(
[6, 2, 8, 0, 4, 7, 9, nil, nil, 3, 5]
),
::TreeNode.new(2),
::TreeNode.new(8)
::TreeNode.build_tree(
[2]
),
::TreeNode.build_tree(
[8]
)
).val
)
end
Expand All @@ -37,25 +27,15 @@ def test_default_two
assert_equal(
2,
lowest_common_ancestor(
::TreeNode.new(
6,
::TreeNode.new(
2,
::TreeNode.new(0),
::TreeNode.new(
4,
::TreeNode.new(3),
::TreeNode.new(5)
)
),
::TreeNode.new(
8,
::TreeNode.new(7),
::TreeNode.new(9)
)
::TreeNode.build_tree(
[6, 2, 8, 0, 4, 7, 9, nil, nil, 3, 5]
),
::TreeNode.build_tree(
[2]
),
::TreeNode.new(2),
::TreeNode.new(4)
::TreeNode.build_tree(
[4]
)
).val
)
end
Expand All @@ -64,13 +44,15 @@ def test_default_three
assert_equal(
2,
lowest_common_ancestor(
::TreeNode.new(
2,
::TreeNode.new(1),
nil
::TreeNode.build_tree(
[2, 1]
),
::TreeNode.new(2),
::TreeNode.new(1)
::TreeNode.build_tree(
[2]
),
::TreeNode.build_tree(
[1]
)
).val
)
end
Expand All @@ -79,25 +61,15 @@ def test_additional_one
assert_equal(
4,
lowest_common_ancestor(
::TreeNode.new(
6,
::TreeNode.new(
2,
::TreeNode.new(0),
::TreeNode.new(
4,
::TreeNode.new(3),
::TreeNode.new(5)
)
),
::TreeNode.new(
8,
::TreeNode.new(7),
::TreeNode.new(9)
)
::TreeNode.build_tree(
[6, 2, 8, 0, 4, 7, 9, nil, nil, 3, 5]
),
::TreeNode.build_tree(
[3]
),
::TreeNode.new(3),
::TreeNode.new(5)
::TreeNode.build_tree(
[5]
)
).val
)
end
Expand Down
66 changes: 24 additions & 42 deletions test/medium/test_236_lowest_common_ancestor_of_a_binary_tree.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,25 +10,15 @@ def test_default_one
assert_equal(
3,
lowest_common_ancestor236(
::TreeNode.new(
3,
::TreeNode.new(
5,
::TreeNode.new(6),
::TreeNode.new(
2,
::TreeNode.new(7),
::TreeNode.new(4)
)
),
::TreeNode.new(
1,
::TreeNode.new(0),
::TreeNode.new(8)
)
::TreeNode.build_tree(
[3, 5, 1, 6, 2, 0, 8, nil, nil, 7, 4]
),
::TreeNode.new(5),
::TreeNode.new(1)
::TreeNode.build_tree(
[5]
),
::TreeNode.build_tree(
[1]
)
).val
)
end
Expand All @@ -37,25 +27,15 @@ def test_default_two
assert_equal(
5,
lowest_common_ancestor236(
::TreeNode.new(
3,
::TreeNode.new(
5,
::TreeNode.new(6),
::TreeNode.new(
2,
::TreeNode.new(7),
::TreeNode.new(4)
)
),
::TreeNode.new(
1,
::TreeNode.new(0),
::TreeNode.new(8)
)
::TreeNode.build_tree(
[3, 5, 1, 6, 2, 0, 8, nil, nil, 7, 4]
),
::TreeNode.build_tree(
[5]
),
::TreeNode.new(5),
::TreeNode.new(4)
::TreeNode.build_tree(
[4]
)
).val
)
end
Expand All @@ -64,13 +44,15 @@ def test_default_three
assert_equal(
1,
lowest_common_ancestor236(
::TreeNode.new(
1,
::TreeNode.new(2),
nil
::TreeNode.build_tree(
[1, 2]
),
::TreeNode.build_tree(
[1]
),
::TreeNode.new(1),
::TreeNode.new(2)
::TreeNode.build_tree(
[2]
)
).val
)
end
Expand Down
Loading
Loading