Skip to content

Commit dbf6630

Browse files
authored
Merge pull request #690 from fartem/95_Unique_Binary_Search_Trees_II
2024-07-26 v. 6.3.2: added "95. Unique Binary Search Trees II"
2 parents 8266088 + fef2d44 commit dbf6630

File tree

4 files changed

+103
-1
lines changed

4 files changed

+103
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -497,3 +497,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
497497
| 82. Remove Duplicates from Sorted List II | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [Link](./lib/medium/82_remove_duplicates_from_sorted_list_ii.rb) |
498498
| 86. Partition List | [Link](https://leetcode.com/problems/partition-list/) | [Link](./lib/medium/86_partition_list.rb) |
499499
| 92. Reverse Linked List II | [Link](https://leetcode.com/problems/reverse-linked-list-ii/) | [Link](./lib/medium/92_reverse_linked_list_ii.rb) |
500+
| 95. Unique Binary Search Trees II | [Link](https://leetcode.com/problems/unique-binary-search-trees-ii/) | [Link](./lib/medium/95_unique_binary_search_trees_ii.rb) |

leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
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 = '6.3.1'
8+
s.version = '6.3.2'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'
Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../common/binary_tree'
4+
5+
# https://leetcode.com/problems/unique-binary-search-trees-ii/
6+
# @param {Integer} n
7+
# @return {TreeNode[]}
8+
def generate_trees(n)
9+
generate95(1, n)
10+
end
11+
12+
private
13+
14+
# @param {Integer} i
15+
# @param {Integer} j
16+
# @return {TreeNode}
17+
def generate95(i, j)
18+
nodes = []
19+
20+
if i > j
21+
nodes << nil
22+
else
23+
(i..j).each do |mid|
24+
left = generate95(i, mid - 1)
25+
right = generate95(mid + 1, j)
26+
27+
left.each do |l|
28+
right.each do |r|
29+
node = ::TreeNode.new(mid)
30+
node.left = l
31+
node.right = r
32+
33+
nodes << node
34+
end
35+
end
36+
end
37+
end
38+
39+
nodes
40+
end
Lines changed: 61 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,61 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/common/binary_tree'
5+
require_relative '../../lib/medium/95_unique_binary_search_trees_ii'
6+
require 'minitest/autorun'
7+
8+
class UniqueBinarySearchTreesIITest < ::Minitest::Test
9+
def test_default
10+
assert_equal(
11+
[
12+
::TreeNode.new(
13+
1,
14+
nil,
15+
::TreeNode.new(
16+
2,
17+
nil,
18+
::TreeNode.new(3)
19+
)
20+
),
21+
::TreeNode.new(
22+
1,
23+
nil,
24+
::TreeNode.new(
25+
3,
26+
::TreeNode.new(2),
27+
nil
28+
)
29+
),
30+
::TreeNode.new(
31+
2,
32+
::TreeNode.new(1),
33+
::TreeNode.new(3)
34+
),
35+
::TreeNode.new(
36+
3,
37+
::TreeNode.new(
38+
1,
39+
nil,
40+
::TreeNode.new(2)
41+
),
42+
nil
43+
),
44+
::TreeNode.new(
45+
3,
46+
::TreeNode.new(
47+
2,
48+
::TreeNode.new(1),
49+
nil
50+
),
51+
nil
52+
)
53+
],
54+
generate_trees(3)
55+
)
56+
assert_equal(
57+
[::TreeNode.new(1)],
58+
generate_trees(1)
59+
)
60+
end
61+
end

0 commit comments

Comments
 (0)