Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2025-01-13 08:01:03 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

Minor changes

Browse source
This commit is contained in:
Vitor Oliveira 2021-04-10 10:41:01 -07:00
parent ce0d1863a2
commit 1c9a26f389
1 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
data_structures/arrays/next_greater_element.rb
View file

@ -18,7 +18,7 @@
#
# Input: nums1 = [2,4], nums2 = [1,2,3,4]
# Output: [3,-1]
#
#
# Explanation:
# For number 2 in the first array, the next greater number for it in the second array is 3.
# For number 4 in the first array, there is no next greater number for it in the second array, so output -1.
@ -27,18 +27,18 @@
# @param {Integer[]} nums2
# @return {Integer[]}
def next_greater_element(nums1, nums2)
nums1.each_with_index do |value, pointer1|
nums1.each_with_index do |nums1_value, pointer1|
max = 0
pos_nums2 = nums2.find_index(value)
pos_nums2 = nums2.find_index(nums1_value)
nums2[pos_nums2..nums2.count].each do |value|
if value > nums1[pointer1]
max = value
nums2[pos_nums2..nums2.count].each do |nums2_value|
if nums2_value > nums1_value
max = nums2_value
break
end
end
nums1[pointer1] = (nums1[pointer1] < max ? max : -1)
nums1[pointer1] = (nums1_value < max ? max : -1)
end
nums1