Ruby带空值排列实现问题：多数组全组合补空需求

The issue with your initial "简易方案" is probably that it uses methods like zip, which only combine elements up to the length of the shortest array—so if any array is empty, it returns nothing. To fix this, we need to generate combinations based on the longest array's length, filling in empty strings for positions where an array has no element.

Here's a clean, robust implementation:

def generate_full_combinations(headlines, sub_headlines, image_urls)
  max_length = [headlines.size, sub_headlines.size, image_urls.size].max
  (0...max_length).map do |index|
    [
      headlines[index] || '',
      sub_headlines[index] || '',
      image_urls[index] || ''
    ]
  end
end

How it works: #

1. Calculate maximum length: We first find the length of the longest array among the three—this determines how many combinations we need to generate.
2. Iterate over each index: For each index from 0 to max_length - 1, we fetch the element from each array at that position.
3. Fill missing elements: If an array doesn't have an element at the current index (returns nil), we replace it with an empty string '' using the || operator.

Example Usage: #

# Test case with mixed lengths
headlines = ["Breaking News: Ruby 3.3 Released", "New Framework Launches"]
sub_headlines = ["Performance Boosts Galore"]
image_urls = ["ruby-release.jpg", "framework-preview.png", "placeholder.png"]

combinations = generate_full_combinations(headlines, sub_headlines, image_urls)
combinations.each { |comb| puts comb.inspect }

Output: #

["Breaking News: Ruby 3.3 Released", "Performance Boosts Galore", "ruby-release.jpg"]
["New Framework Launches", "", "framework-preview.png"]
["", "", "placeholder.png"]

This ensures we get all possible combinations, even when some arrays are shorter or completely empty.

内容的提问来源于stack exchange，提问作者Tallboy