From e9e0c07d8a5d0782b4dec0e20c49e79d87630547 Mon Sep 17 00:00:00 2001 From: fartem Date: Thu, 23 Jan 2025 20:43:14 +0300 Subject: [PATCH] 2025-01-23 v. 8.2.5.7: small refactoring --- leetcode-ruby.gemspec | 2 +- lib/common/binary_tree.rb | 7 ++++--- 2 files changed, 5 insertions(+), 4 deletions(-) diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index 9d077606..b8975581 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.5.6' + s.version = '8.2.5.7' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/common/binary_tree.rb b/lib/common/binary_tree.rb index 526b65c2..cd1a2c92 100644 --- a/lib/common/binary_tree.rb +++ b/lib/common/binary_tree.rb @@ -21,11 +21,12 @@ def self.are_equals(curr, other) return false if !curr || !other - curr_eq = curr.val == other.val + return false unless curr.val == other.val + left_eq = are_equals(curr.left, other.left) right_eq = are_equals(curr.right, other.right) - curr_eq && left_eq && right_eq + left_eq && right_eq end # @param {Integer[]} nodes @@ -39,9 +40,9 @@ def self.build_tree(nodes) while i < nodes.length current = queue.shift + next unless current - # Left child if i < nodes.length && !nodes[i].nil? current.left = ::TreeNode.new(nodes[i])