From 35c842b5f3ca25723ccd37a437e8cb41ea92d58e Mon Sep 17 00:00:00 2001 From: fartem Date: Wed, 22 Jan 2025 11:47:46 +0300 Subject: [PATCH 1/2] 2025-01-22 v. 8.2.3: added "1019. Next Greater Node In Linked List" --- README.md | 1 + leetcode-ruby.gemspec | 2 +- .../1019_next_greater_node_in_linked_list.rb | 24 +++++++++++++++ ...t_1019_next_greater_node_in_linked_list.rb | 30 +++++++++++++++++++ 4 files changed, 56 insertions(+), 1 deletion(-) create mode 100644 lib/medium/1019_next_greater_node_in_linked_list.rb create mode 100644 test/medium/test_1019_next_greater_node_in_linked_list.rb diff --git a/README.md b/README.md index 18650b9c..c1f25353 100644 --- a/README.md +++ b/README.md @@ -655,6 +655,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/). | 988. Smallest String Starting From Leaf | [Link](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | [Link](./lib/medium/988_smallest_string_starting_from_leaf.rb) | [Link](./test/medium/test_988_smallest_string_starting_from_leaf.rb) | | 998. Maximum Binary Tree II | [Link](https://leetcode.com/problems/maximum-binary-tree-ii/) | [Link](./lib/medium/998_maximum_binary_tree_ii.rb) | [Link](./test/medium/test_998_maximum_binary_tree_ii.rb) | | 1008. Construct Binary Search Tree from Preorder Traversal | [Link](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | [Link](./lib/medium/1008_construct_binary_search_tree_from_preorder_traversal.rb) | [Link](./test/medium/test_1008_construct_binary_search_tree_from_preorder_traversal.rb) | +| 1019. Next Greater Node In Linked List | [Link](https://leetcode.com/problems/next-greater-node-in-linked-list/) | [Link](./lib/medium/1019_next_greater_node_in_linked_list.rb) | [Link](./test/medium/test_1019_next_greater_node_in_linked_list.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 ff5e878a..883bb20e 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.2' + s.version = '8.2.3' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/lib/medium/1019_next_greater_node_in_linked_list.rb b/lib/medium/1019_next_greater_node_in_linked_list.rb new file mode 100644 index 00000000..3cd93f54 --- /dev/null +++ b/lib/medium/1019_next_greater_node_in_linked_list.rb @@ -0,0 +1,24 @@ +# frozen_string_literal: true + +# https://leetcode.com/problems/next-greater-node-in-linked-list/ +# @param {ListNode} head +# @return {Integer[]} +def next_larger_nodes(head) + nodes = [] + pointer = head + + while pointer + nodes << pointer.val + pointer = pointer.next + end + + result = ::Array.new(nodes.size, 0) + values = [] + + nodes.each_with_index do |node, i| + result[values.pop] = node while !values.empty? && node > nodes[values.last] + values.push(i) + end + + result +end diff --git a/test/medium/test_1019_next_greater_node_in_linked_list.rb b/test/medium/test_1019_next_greater_node_in_linked_list.rb new file mode 100644 index 00000000..1cf28703 --- /dev/null +++ b/test/medium/test_1019_next_greater_node_in_linked_list.rb @@ -0,0 +1,30 @@ +# frozen_string_literal: true + +require_relative '../test_helper' +require_relative '../../lib/common/linked_list' +require_relative '../../lib/medium/1019_next_greater_node_in_linked_list' +require 'minitest/autorun' + +class NextGreaterNodeInLinkedListTest < ::Minitest::Test + def test_default_one + assert_equal( + [5, 5, 0], + next_larger_nodes( + ::ListNode.from_array( + [2, 1, 5] + ) + ) + ) + end + + def test_default_two + assert_equal( + [7, 0, 5, 5, 0], + next_larger_nodes( + ::ListNode.from_array( + [2, 7, 4, 3, 5] + ) + ) + ) + end +end From 3495f26f85bd90fdf0616814a959d5f09f3b0acf Mon Sep 17 00:00:00 2001 From: fartem Date: Wed, 22 Jan 2025 11:48:43 +0300 Subject: [PATCH 2/2] 2025-01-22 v. 8.2.3: updated "1019. Next Greater Node In Linked List" --- lib/medium/1019_next_greater_node_in_linked_list.rb | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/lib/medium/1019_next_greater_node_in_linked_list.rb b/lib/medium/1019_next_greater_node_in_linked_list.rb index 3cd93f54..a8559a9e 100644 --- a/lib/medium/1019_next_greater_node_in_linked_list.rb +++ b/lib/medium/1019_next_greater_node_in_linked_list.rb @@ -17,7 +17,8 @@ def next_larger_nodes(head) nodes.each_with_index do |node, i| result[values.pop] = node while !values.empty? && node > nodes[values.last] - values.push(i) + + values << i end result