C# 怎样用a-z生成8位字符串的所有组合

char ba[]={"A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"};
string s;
for(int a=0;a for(int b=0;b for(int c=0;c for(int d=0;d for(int e=0;e for(int f=0;f for(int g=0;g for(int h=0;h s=s+ba[a]+ba[b]+ba[c]+ba[d]+ba[e]+ba[f]+ba[g]+ba[h]+"\n";
}
}
}
}
}
}
}
}
代码应该就是这样的吧!C#不常用.

8层for循环，不过运行时很卡，要计算26的8次方次

先给你个思路：
例如：a,b,c,d,e,f中组合成长度为3的字符串：
1.
aaa
aab
aac
aad
aae
aaf
aba
abb
abc
abd
abe
abf
aca
acb
acc
acd
ace
acf
...
类推下去，找到规律，然后用循环穷举就可以了

这个数量相当庞大吧 你Java跑几天就跑不完

组合啥要求？