计算所有可能的对项目的两个列表？

Question

我有两个数组：

string[] Group = { "A", null, "B", null, "C", null };

string[] combination = { "C#", "Java", null, "C++", null }; 

我希望返回所有可能的组合等：

{ {"A","C#"} , {"A","Java"} , {"A","C++"},{"B","C#"},............ }

空应该被忽略。

Answer 1

Group.Where(x => x != null)
     .SelectMany(g => combination.Where(c => c != null)
                                 .Select(c => new {Group = g, Combination = c}));

可替换地：

from g in Group where g != null
from c in combination where c != null
select new { Group = g, Combination = c }