From 8c028568afc6034dd58b4c0bcbe6777e7e046aa5 Mon Sep 17 00:00:00 2001 From: fartem Date: Thu, 16 Jan 2025 08:31:49 +0300 Subject: [PATCH] 2025-01-16 v. 8.1.2.1: small refactoring --- leetcode-ruby.gemspec | 2 +- lib/easy/933_number_of_recent_calls.rb | 2 +- lib/easy/993_cousins_in_binary_tree.rb | 3 ++- lib/medium/402_remove_k_digits.rb | 2 +- lib/medium/429_n_ary_tree_level_order_traversal.rb | 2 +- lib/medium/515_find_largest_value_in_each_tree_row.rb | 2 +- lib/medium/623_add_one_row_to_tree.rb | 4 ++-- lib/medium/662_maximum_width_of_binary_tree.rb | 2 +- 8 files changed, 10 insertions(+), 9 deletions(-) diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index 0791729c..6d68bade 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.1.2' + s.version = '8.1.2.1' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/easy/933_number_of_recent_calls.rb b/lib/easy/933_number_of_recent_calls.rb index 227f90f1..5a0e36cc 100644 --- a/lib/easy/933_number_of_recent_calls.rb +++ b/lib/easy/933_number_of_recent_calls.rb @@ -11,7 +11,7 @@ def initialize # @return {Integer} def ping(t) @requests << t - @requests.delete_at(0) while @requests.first < t - 3000 + @requests.shift while @requests.first < t - 3000 @requests.length end diff --git a/lib/easy/993_cousins_in_binary_tree.rb b/lib/easy/993_cousins_in_binary_tree.rb index ddb72dea..880618b4 100644 --- a/lib/easy/993_cousins_in_binary_tree.rb +++ b/lib/easy/993_cousins_in_binary_tree.rb @@ -11,7 +11,8 @@ def is_cousins(root, x, y) queue << nil found = 0 until queue.empty? - curr = queue.delete_at(0) + curr = queue.shift + if curr.nil? queue << nil unless queue.empty? found = 0 diff --git a/lib/medium/402_remove_k_digits.rb b/lib/medium/402_remove_k_digits.rb index f834ad29..329a4c89 100644 --- a/lib/medium/402_remove_k_digits.rb +++ b/lib/medium/402_remove_k_digits.rb @@ -28,7 +28,7 @@ def remove_kdigits(num, k) result << stack.pop until stack.empty? result.reverse! - result.delete_at(0) while result.size > 1 && result[0] == '0' + result.shift while result.size > 1 && result[0] == '0' result.join end diff --git a/lib/medium/429_n_ary_tree_level_order_traversal.rb b/lib/medium/429_n_ary_tree_level_order_traversal.rb index 753280ca..7dbb3748 100644 --- a/lib/medium/429_n_ary_tree_level_order_traversal.rb +++ b/lib/medium/429_n_ary_tree_level_order_traversal.rb @@ -13,7 +13,7 @@ def level_order429(root) size = queue.size (0...size).each do |_| - node = queue.delete_at(0) + node = queue.shift level << node.val node.children&.each { |child| queue << child } diff --git a/lib/medium/515_find_largest_value_in_each_tree_row.rb b/lib/medium/515_find_largest_value_in_each_tree_row.rb index 679e202a..0d31f448 100644 --- a/lib/medium/515_find_largest_value_in_each_tree_row.rb +++ b/lib/medium/515_find_largest_value_in_each_tree_row.rb @@ -12,7 +12,7 @@ def largest_values(root) size = nodes.size max = -::Float::INFINITY (0...size).each do |_| - node = nodes.delete_at(0) + node = nodes.shift max = node.val if node.val > max diff --git a/lib/medium/623_add_one_row_to_tree.rb b/lib/medium/623_add_one_row_to_tree.rb index ac932b7f..a94ed1c1 100644 --- a/lib/medium/623_add_one_row_to_tree.rb +++ b/lib/medium/623_add_one_row_to_tree.rb @@ -17,7 +17,7 @@ def add_one_row(root, val, depth) if (level + 1) == depth until size.zero? - node = nodes.delete_at(0) + node = nodes.shift left = node.left right = node.right node.left = ::TreeNode.new(val, left, nil) @@ -27,7 +27,7 @@ def add_one_row(root, val, depth) end else until size.zero? - node = nodes.delete_at(0) + node = nodes.shift nodes << node.left if node.left nodes << node.right if node.right diff --git a/lib/medium/662_maximum_width_of_binary_tree.rb b/lib/medium/662_maximum_width_of_binary_tree.rb index ef0b3c75..fbfe22b5 100644 --- a/lib/medium/662_maximum_width_of_binary_tree.rb +++ b/lib/medium/662_maximum_width_of_binary_tree.rb @@ -11,7 +11,7 @@ def width_of_binary_tree(root) min = +1.0 / 0.0 max = 0 (0...size).each do |_i| - pair = nodes.delete_at(0) + pair = nodes.shift min = [min, pair.value].min max = [max, pair.value].max