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

add output for max_product algorithm

Browse source
This commit is contained in:
Vitor Oliveira 2021-09-03 12:35:10 -07:00 committed by GitHub
parent bd92198fc8
commit b7d623a303
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 42 additions and 35 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
data_structures/arrays/maximum_product_subarray.rb
View file

@ -1,3 +1,4 @@
# Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product. # Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.
# It is guaranteed that the answer will fit in a 32-bit integer. # It is guaranteed that the answer will fit in a 32-bit integer.
# A subarray is a contiguous subsequence of the array. # A subarray is a contiguous subsequence of the array.
@ -17,20 +18,18 @@
#-10 <= nums[i] <= 10 #-10 <= nums[i] <= 10
# The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. # The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
# Dynamic Programming Approach (Kadane's Algorithm) - O(n) Time / O(1) Space # Dynamic Programming Approach (Kadane's Algorithm) - O(n) Time / O(1) Space
# Track both current minimum and current maximum (Due to possibility of multiple negative numbers) # Track both current minimum and current maximum (Due to possibility of multiple negative numbers)
# Answer is the highest value of current maximum # Answer is the highest value of current maximum
# @param {Integer[]} nums # @param {Integer[]} nums
# @return {Integer} # @return {Integer}
def max_product(nums) def max_product(nums)
return nums[0] if nums.length == 1 return nums[0] if nums.length == 1
cur_min, cur_max, max = 1, 1, -11 cur_min = 1
cur_max = 1
max = -11
nums.each do |val| nums.each do |val|
tmp_cur_max = cur_max tmp_cur_max = cur_max
@ -42,3 +41,11 @@ def max_product(nums)
max max
end end
nums = [2, 3, -2, 4]
puts max_product(nums)
# Output: 6
nums = [-2, 0, -1]
puts max_product(nums)
# Output: 0