Leetcode solution for contest problem "Corporate Flight Bookings" in Ruby

corporate_filght_bookings.rb

def corp_flight_bookings(bookings, n)
    min_max = []
    return bookings if bookings.empty? or bookings[0].empty?
    bookings.each do |i|
     min_max << i[0] << i[1]
     min_max << 1 if i[0]!=1 and i[1]!=1
    end
    min_max.sort!
    min_max.uniq!
    min = min_max.first
    max = min_max.last 
    min_max.clear
    for x in min..max do
     min_max << x
    end
    sum=0
    out = []
   
    min_max.each do |x|
     bookings.each do |y| 
          if x.between?(y[0],y[1])
           sum+=y[2]
          end
      end
      out << sum
     sum = 0
    end
     p out
end