From 282dc85ecf9e73c178f217c1d2b9a8f5e1d8387b Mon Sep 17 00:00:00 2001 From: fartem Date: Thu, 9 Jan 2025 11:52:31 +0300 Subject: [PATCH] 2025-01-09 v. 7.8.3: added "894. All Possible Full Binary Trees" --- README.md | 1 + leetcode-ruby.gemspec | 2 +- .../894_all_possible_full_binary_trees.rb | 38 ++++++ ...test_894_all_possible_full_binary_trees.rb | 114 ++++++++++++++++++ 4 files changed, 154 insertions(+), 1 deletion(-) create mode 100644 lib/medium/894_all_possible_full_binary_trees.rb create mode 100644 test/medium/test_894_all_possible_full_binary_trees.rb diff --git a/README.md b/README.md index a0ba528b..fb63c1ea 100644 --- a/README.md +++ b/README.md @@ -635,6 +635,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/). | 880. Decoded String at Index | [Link](https://leetcode.com/problems/decoded-string-at-index/) | [Link](./lib/medium/880_decoded_string_at_index.rb) | [Link](./test/medium/test_880_decoded_string_at_index.rb) | | 889. Construct Binary Tree from Preorder and Postorder Traversal | [Link](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | [Link](./lib/medium/889_construct_binary_tree_from_preorder_and_postorder_traversal.rb) | [Link](./test/medium/test_889_construct_binary_tree_from_preorder_and_postorder_traversal.rb) | | 890. Find and Replace Pattern | [Link](https://leetcode.com/problems/find-and-replace-pattern/) | [Link](./lib/medium/890_find_and_replace_pattern.rb) | [Link](./test/medium/test_890_find_and_replace_pattern.rb) | +| 894. All Possible Full Binary Trees | [Link](https://leetcode.com/problems/all-possible-full-binary-trees/) | [Link](./lib/medium/894_all_possible_full_binary_trees.rb) | [Link](./test/medium/test_894_all_possible_full_binary_trees.rb) | ### Hard diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index 77a8642b..9bd2208e 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.8.2' + s.version = '7.8.3' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/medium/894_all_possible_full_binary_trees.rb b/lib/medium/894_all_possible_full_binary_trees.rb new file mode 100644 index 00000000..5805e227 --- /dev/null +++ b/lib/medium/894_all_possible_full_binary_trees.rb @@ -0,0 +1,38 @@ +# frozen_string_literal: true + +require_relative '../common/binary_tree' + +# https://leetcode.com/problems/all-possible-full-binary-trees/ +# @param {Integer} n +# @return {TreeNode[]} +def all_possible_fbt(n) + @values = {} + + fill_all_possible_fbt(n) +end + +private + +# @param {Integer} n +# @result {TreeNode[]} +def fill_all_possible_fbt(n) + return @values[n] if @values.key?(n) + + nodes = [] + + if n == 1 + nodes << ::TreeNode.new(0) + elsif n.odd? + (0...n).each do |i| + j = n - 1 - i + + fill_all_possible_fbt(i).each do |left| + fill_all_possible_fbt(j).each do |right| + nodes << ::TreeNode.new(0, left, right) + end + end + end + end + + @values[n] = nodes +end diff --git a/test/medium/test_894_all_possible_full_binary_trees.rb b/test/medium/test_894_all_possible_full_binary_trees.rb new file mode 100644 index 00000000..83aa6978 --- /dev/null +++ b/test/medium/test_894_all_possible_full_binary_trees.rb @@ -0,0 +1,114 @@ +# frozen_string_literal: true + +require_relative '../test_helper' +require_relative '../../lib/common/binary_tree' +require_relative '../../lib/medium/894_all_possible_full_binary_trees' +require 'minitest/autorun' + +class AllPossibleFullBinaryTreesTest < ::Minitest::Test + def test_default_one + correct = [ + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ) + ) + ), + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new( + 0, + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ), + ::TreeNode.new(0) + ) + ), + ::TreeNode.new( + 0, + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ), + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ) + ), + ::TreeNode.new( + 0, + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ) + ), + ::TreeNode.new(0) + ), + ::TreeNode.new( + 0, + ::TreeNode.new( + 0, + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ), + ::TreeNode.new(0) + ), + ::TreeNode.new(0) + ) + ] + + result = all_possible_fbt(7) + + assert_equal(5, result.size) + + result.each_with_index do |node, index| + assert( + ::TreeNode.are_equals( + node, + correct[index] + ) + ) + end + end + + def test_default_two + correct = [ + ::TreeNode.new( + 0, + ::TreeNode.new(0), + ::TreeNode.new(0) + ) + ] + + result = all_possible_fbt(3) + + assert_equal(1, result.size) + + result.each_with_index do |node, index| + assert( + ::TreeNode.are_equals( + node, + correct[index] + ) + ) + end + end +end