From a683012e204728574804c01977d6f4437d243462 Mon Sep 17 00:00:00 2001 From: fartem Date: Fri, 20 Dec 2024 09:43:22 +0300 Subject: [PATCH 1/2] 2024-12-20 v. 7.4.2: added "669. Trim a Binary Search Tree" --- README.md | 1 + leetcode-ruby.gemspec | 2 +- lib/medium/669_trim_a_binary_search_tree.rb | 19 ++++++ .../test_669_trim_a_binary_search_tree.rb | 62 +++++++++++++++++++ 4 files changed, 83 insertions(+), 1 deletion(-) create mode 100644 lib/medium/669_trim_a_binary_search_tree.rb create mode 100644 test/medium/test_669_trim_a_binary_search_tree.rb diff --git a/README.md b/README.md index d0dda127..af8c5359 100644 --- a/README.md +++ b/README.md @@ -606,3 +606,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/). | 654. Maximum Binary Tree | [Link](https://leetcode.com/problems/maximum-binary-tree/) | [Link](./lib/medium/654_maximum_binary_tree.rb) | [Link](./test/medium/test_654_maximum_binary_tree.rb) | | 659. Split Array into Consecutive Subsequences | [Link](https://leetcode.com/problems/split-array-into-consecutive-subsequences/) | [Link](./lib/medium/659_split_array_into_consecutive_subsequences.rb) | [Link](./test/medium/test_659_split_array_into_consecutive_subsequences.rb) | | 662. Maximum Width of Binary Tree | [Link](https://leetcode.com/problems/maximum-width-of-binary-tree/) | [Link](./lib/medium/662_maximum_width_of_binary_tree.rb) | [Link](./test/medium/test_662_maximum_width_of_binary_tree.rb) | +| 669. Trim a Binary Search Tree | [Link](https://leetcode.com/problems/trim-a-binary-search-tree/) | [Link](./lib/medium/669_trim_a_binary_search_tree.rb) | [Link](./test/medium/test_669_trim_a_binary_search_tree.rb) | diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index 79eac456..cc3cf3a1 100644 --- a/leetcode-ruby.gemspec +++ b/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 = '7.4.1' + s.version = '7.4.2' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/medium/669_trim_a_binary_search_tree.rb b/lib/medium/669_trim_a_binary_search_tree.rb new file mode 100644 index 00000000..d31131df --- /dev/null +++ b/lib/medium/669_trim_a_binary_search_tree.rb @@ -0,0 +1,19 @@ +# frozen_string_literal: true + +# https://leetcode.com/problems/trim-a-binary-search-tree/ +# @param {TreeNode} root +# @param {Integer} low +# @param {Integer} high +# @return {TreeNode} +def trim_bst(root, low, high) + return unless root + + return trim_bst(root.left, low, high) if root.val > high + + return trim_bst(root.right, low, high) if root.val < low + + root.left = trim_bst(root.left, low, high) + root.right = trim_bst(root.right, low, high) + + root +end diff --git a/test/medium/test_669_trim_a_binary_search_tree.rb b/test/medium/test_669_trim_a_binary_search_tree.rb new file mode 100644 index 00000000..1e1db810 --- /dev/null +++ b/test/medium/test_669_trim_a_binary_search_tree.rb @@ -0,0 +1,62 @@ +# frozen_string_literal: true + +require_relative '../test_helper' +require_relative '../../lib/common/binary_tree' +require_relative '../../lib/medium/669_trim_a_binary_search_tree' +require 'minitest/autorun' + +class MaximumWidthOfBinaryTreeTest < ::Minitest::Test + def test_default_one + assert( + ::TreeNode.are_equals( + ::TreeNode.new( + 1, + nil, + ::TreeNode.new(2) + ), + trim_bst( + ::TreeNode.new( + 1, + ::TreeNode.new(0), + ::TreeNode.new(2) + ), + 1, + 2 + ) + ) + ) + end + + def test_default_two + assert( + ::TreeNode.are_equals( + ::TreeNode.new( + 3, + ::TreeNode.new( + 2, + ::TreeNode.new(1), + nil + ), + nil + ), + trim_bst( + ::TreeNode.new( + 3, + ::TreeNode.new( + 0, + nil, + ::TreeNode.new( + 2, + ::TreeNode.new(1), + nil + ) + ), + ::TreeNode.new(4) + ), + 1, + 3 + ) + ) + ) + end +end From c83c0d9954458610fae44ecef9dac1b343fab405 Mon Sep 17 00:00:00 2001 From: fartem Date: Fri, 20 Dec 2024 09:43:30 +0300 Subject: [PATCH 2/2] 2024-12-20 v. 7.4.2: added "669. Trim a Binary Search Tree" --- test/medium/test_669_trim_a_binary_search_tree.rb | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/test/medium/test_669_trim_a_binary_search_tree.rb b/test/medium/test_669_trim_a_binary_search_tree.rb index 1e1db810..627ccaaf 100644 --- a/test/medium/test_669_trim_a_binary_search_tree.rb +++ b/test/medium/test_669_trim_a_binary_search_tree.rb @@ -5,7 +5,7 @@ require_relative '../../lib/medium/669_trim_a_binary_search_tree' require 'minitest/autorun' -class MaximumWidthOfBinaryTreeTest < ::Minitest::Test +class TrimABinarySearchTreeTest < ::Minitest::Test def test_default_one assert( ::TreeNode.are_equals(