Leetcode 11: Container with most water storage

leetcode_11_Container_with_most_water_storage.rb

Leetcode 11: Container with most water storage

# @param {Integer[]} height
# @return {Integer}
def max_area(height)
    i = 0
    j = height.length - 1
    max_r = 0
    while i < j do
        if height[i] < height[j]
            curr = height[i] * (j - i)
            max_r = [max_r, curr].max
            k = i + 1
            while k < j && height[k] < height[i] do
                k += 1
            end
            i = k
        else
            curr = height[j] * (j - i)
            max_r = [max_r, curr].max
            k = j - 1
            while k > i && height[k] < height[j] do
                k -= 1
            end
            j = k
        end
    end
    max_r
end