Merge pull request #707 from fartem/117_Populating_Next_Right_Pointers_in_Each_Node_II

2024-08-12 v. 6.4.5: added "117. Populating Next Right Pointers in Each Node II"

Author: fartem

README.md

@@ -510,3 +510,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 113. Path Sum II                                                | [Link](https://leetcode.com/problems/path-sum-ii/)                                                | [Link](./lib/medium/113_path_sum_ii.rb)                                                |
 | 114. Flatten Binary Tree to Linked List                         | [Link](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)                         | [Link](./lib/medium/114_flatten_binary_tree_to_linked_list.rb)                         |
 | 116. Populating Next Right Pointers in Each Node                | [Link](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)                | [Link](./lib/medium/116_populating_next_right_pointers_in_each_node.rb)                |
+| 117. Populating Next Right Pointers in Each Node II             | [Link](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)             | [Link](./lib/medium/117_populating_next_right_pointers_in_each_node_ii.rb)             |

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 = '6.4.4'
+  s.version = '6.4.5'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/117_populating_next_right_pointers_in_each_node_ii.rb

@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/
+# @param {Node} root
+# @return {Node}
+def connect117(root)
+  return unless root
+
+  nodes = [root]
+  until nodes.empty?
+    size = nodes.size
+    level = []
+    until size.zero?
+      node = nodes.shift
+      if node.left
+        level << node.left
+        nodes << node.left
+      end
+      if node.right
+        level << node.right
+        nodes << node.right
+      end
+
+      size -= 1
+    end
+
+    (0...(level.size - 1)).each do |i|
+      level[i].next = level[i + 1]
+    end
+  end
+
+  root
+end

test/medium/test_117_populating_next_right_pointers_in_each_node_ii.rb

@@ -0,0 +1,58 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/next_tree_node'
+require_relative '../../lib/medium/117_populating_next_right_pointers_in_each_node_ii'
+require 'minitest/autorun'
+
+class PopulatingNextRightPointersInEachNodeIITest < ::Minitest::Test
+  def test_default
+    ntn3 = ::NextTreeNode.new(3)
+    ntn5 = ::NextTreeNode.new(5)
+    ntn7 = ::NextTreeNode.new(7)
+    ntn3.right = ntn7
+    ntn5.next = ntn7
+
+    assert(
+      ::NextTreeNode.are_equals(
+        ::NextTreeNode.new(
+          1,
+          ::NextTreeNode.new(
+            2,
+            ::NextTreeNode.new(
+              4,
+              nil,
+              nil,
+              ntn5
+            ),
+            ntn5,
+            ntn3
+          ),
+          ntn3
+        ),
+        connect117(
+          ::NextTreeNode.new(
+            1,
+            ::NextTreeNode.new(
+              2,
+              ::NextTreeNode.new(4),
+              ::NextTreeNode.new(5)
+            ),
+            ::NextTreeNode.new(
+              3,
+              nil,
+              ::NextTreeNode.new(7)
+            )
+          )
+        )
+      )
+    )
+
+    assert(
+      ::NextTreeNode.are_equals(
+        nil,
+        connect117(nil)
+      )
+    )
+  end
+end