From 3531bae5edd1c1b0fe793a4721ba5eb5e93747ca Mon Sep 17 00:00:00 2001 From: fartem Date: Fri, 24 Jan 2025 12:00:01 +0300 Subject: [PATCH] 2025-01-24 v. 8.2.7: added "1038. Binary Search Tree to Greater Sum Tree" --- README.md | 1 + leetcode-ruby.gemspec | 2 +- ..._binary_search_tree_to_greater_sum_tree.rb | 33 ++++++++------- .../1043_partition_array_for_maximum_sum.rb | 23 +++++++++++ ..._binary_search_tree_to_greater_sum_tree.rb | 41 ++++++++++--------- ...st_1043_partition_array_for_maximum_sum.rb | 37 +++++++++++++++++ 6 files changed, 101 insertions(+), 36 deletions(-) create mode 100644 lib/medium/1043_partition_array_for_maximum_sum.rb create mode 100644 test/medium/test_1043_partition_array_for_maximum_sum.rb diff --git a/README.md b/README.md index 55017327..eb83e97f 100644 --- a/README.md +++ b/README.md @@ -659,6 +659,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/). | 1023. Camelcase Matching | [Link](https://leetcode.com/problems/camelcase-matching/) | [Link](./lib/medium/1023_camelcase_matching.rb) | [Link](./test/medium/test_1023_camelcase_matching.rb) | | 1026. Maximum Difference Between Node and Ancestor | [Link](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) | [Link](./lib/medium/1026_maximum_difference_between_node_and_ancestor.rb) | [Link](./test/medium/test_1026_maximum_difference_between_node_and_ancestor.rb) | | 1038. Binary Search Tree to Greater Sum Tree | [Link](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | [Link](./lib/medium/1038_binary_search_tree_to_greater_sum_tree.rb) | [Link](./test/medium/test_1038_binary_search_tree_to_greater_sum_tree.rb) | +| 1043. Partition Array for Maximum Sum | [Link](https://leetcode.com/problems/partition-array-for-maximum-sum/) | [Link](./lib/medium/1043_partition_array_for_maximum_sum.rb) | [Link](./test/medium/test_1043_partition_array_for_maximum_sum.rb) | | 1400. Construct K Palindrome Strings | [Link](https://leetcode.com/problems/construct-k-palindrome-strings/) | [Link](./lib/medium/1400_construct_k_palindrome_strings.rb) | [Link](./test/medium/test_1400_construct_k_palindrome_strings.rb) | | 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) | | 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) | diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index d271079a..0b692b58 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 = '8.2.6.1' + s.version = '8.2.7' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/medium/1038_binary_search_tree_to_greater_sum_tree.rb b/lib/medium/1038_binary_search_tree_to_greater_sum_tree.rb index 7b7253f3..46a0f7d7 100644 --- a/lib/medium/1038_binary_search_tree_to_greater_sum_tree.rb +++ b/lib/medium/1038_binary_search_tree_to_greater_sum_tree.rb @@ -1,23 +1,26 @@ # frozen_string_literal: true # https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/ -# @param {Integer[]} arr -# @param {Integer} k -# @return {Integer} -def max_sum_after_partitioning(arr, k) - partitioned = ::Array.new(arr.size + 1, 0) +# @param {TreeNode} root +# @return {TreeNode} +def bst_to_gst(root) + @sum = 0 + transform_tree(root) - (1..arr.size).each do |i| - max = 0 - val = 0 + root +end + +private + +# @param {TreeNode} node +# @return {Void} +def transform_tree(node) + return unless node - [i, k].min.times do |j| - max = [max, arr[i - j - 1]].max - val = [partitioned[i - j - 1] + max * (j + 1), val].max - end + transform_tree(node.right) - partitioned[i] = val - end + @sum += node.val + node.val = @sum - partitioned[arr.size] + transform_tree(node.left) end diff --git a/lib/medium/1043_partition_array_for_maximum_sum.rb b/lib/medium/1043_partition_array_for_maximum_sum.rb new file mode 100644 index 00000000..7b7253f3 --- /dev/null +++ b/lib/medium/1043_partition_array_for_maximum_sum.rb @@ -0,0 +1,23 @@ +# frozen_string_literal: true + +# https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/ +# @param {Integer[]} arr +# @param {Integer} k +# @return {Integer} +def max_sum_after_partitioning(arr, k) + partitioned = ::Array.new(arr.size + 1, 0) + + (1..arr.size).each do |i| + max = 0 + val = 0 + + [i, k].min.times do |j| + max = [max, arr[i - j - 1]].max + val = [partitioned[i - j - 1] + max * (j + 1), val].max + end + + partitioned[i] = val + end + + partitioned[arr.size] +end diff --git a/test/medium/test_1038_binary_search_tree_to_greater_sum_tree.rb b/test/medium/test_1038_binary_search_tree_to_greater_sum_tree.rb index e9674ce4..dea8c74c 100644 --- a/test/medium/test_1038_binary_search_tree_to_greater_sum_tree.rb +++ b/test/medium/test_1038_binary_search_tree_to_greater_sum_tree.rb @@ -1,36 +1,37 @@ # frozen_string_literal: true require_relative '../test_helper' +require_relative '../../lib/common/binary_tree' require_relative '../../lib/medium/1038_binary_search_tree_to_greater_sum_tree' require 'minitest/autorun' class BinarySearchTreeToGreaterSumTreeTest < ::Minitest::Test def test_default_one - assert_equal( - 84, - max_sum_after_partitioning( - [1, 15, 7, 9, 2, 5, 10], - 3 + assert( + ::TreeNode.are_equals( + ::TreeNode.build_tree( + [30, 36, 21, 36, 35, 26, 15, nil, nil, nil, 33, nil, nil, nil, 8] + ), + bst_to_gst( + ::TreeNode.build_tree( + [4, 1, 6, 0, 2, 5, 7, nil, nil, nil, 3, nil, nil, nil, 8] + ) + ) ) ) end def test_default_two - assert_equal( - 83, - max_sum_after_partitioning( - [1, 4, 1, 5, 7, 3, 6, 1, 9, 9, 3], - 4 - ) - ) - end - - def test_default_three - assert_equal( - 1, - max_sum_after_partitioning( - [1], - 1 + assert( + ::TreeNode.are_equals( + ::TreeNode.build_tree( + [1, nil, 1] + ), + bst_to_gst( + ::TreeNode.build_tree( + [0, nil, 1] + ) + ) ) ) end diff --git a/test/medium/test_1043_partition_array_for_maximum_sum.rb b/test/medium/test_1043_partition_array_for_maximum_sum.rb new file mode 100644 index 00000000..595d9efe --- /dev/null +++ b/test/medium/test_1043_partition_array_for_maximum_sum.rb @@ -0,0 +1,37 @@ +# frozen_string_literal: true + +require_relative '../test_helper' +require_relative '../../lib/medium/1043_partition_array_for_maximum_sum' +require 'minitest/autorun' + +class PartitionArrayForMaximumSumTest < ::Minitest::Test + def test_default_one + assert_equal( + 84, + max_sum_after_partitioning( + [1, 15, 7, 9, 2, 5, 10], + 3 + ) + ) + end + + def test_default_two + assert_equal( + 83, + max_sum_after_partitioning( + [1, 4, 1, 5, 7, 3, 6, 1, 9, 9, 3], + 4 + ) + ) + end + + def test_default_three + assert_equal( + 1, + max_sum_after_partitioning( + [1], + 1 + ) + ) + end +end