例如有以下字符串
a b c d e f g h i j
组合
a b c
a d e
a f g
a h i
......
把所有组合情况组合一遍,而且组合的结果中,至少要有两个子字符串是不一样的
求大神给个组合方法
C#语言实现
利用数组
然后用三个for循环,最里面加个判断
满足条件
(a[i]!=a[j]&&a[j]!=a[k]) || (a[i]==a[j]&&a[i]!=a[k]) || (a[i]!=a[k]&&a[i]==a[k]) || (a[j]==a[k]&&a[i]!=a[k])
就输出
我的思路这样的,具体你自己实现吧
string m = "a b c d e f g h i j";
var query = from a in m.Split(' ')
from b in m.Split(' ')
from c in m.Split(' ')
where (a+b+c).Distinct().Count() >= 2
select a + " " + b + " " + c;
foreach (var s in query) Console.WriteLine(s);
string m = "a b c d e f g h i j";
var query = from a in m.Split(' ')
from b in m.Split(' ')
where a != b
select a + " " + b;
foreach (var s in query) Console.WriteLine(s);