C#查找字符串的所有排列组合
// 1. remove first char// 2. find permutations of the rest of chars// 3. Attach the first char to each of those permutations.// 3.1 for each permutation, move firstChar in all indexes to produce even more permutations.// 4. Return list of possible permutations. public string[] FindPermutations(string word) { if (word.Length == 2) { char[] _c = word.ToCharArray(); string s = new string(new char[] { _c[1], _c[0] }); return new string[] { word, s }; } List _result = new List(); string[] _subsetPermutations = FindPermutations(word.Substring(1)); char _firstChar = word[0]; foreach (string s in _subsetPermutations) { string _temp = _firstChar.ToString() + s; _result.Add(_temp); char[] _chars = _temp.ToCharArray(); for (int i = 0; i < _temp.Length - 1; i++) <strong>本文来源gaodai#ma#com搞@@代~&码网</strong> { char t = _chars[i]; _chars[i] = _chars[i + 1]; _chars[i + 1] = t; string s2 = new string(_chars); _result.Add(s2); } } return _result.ToArray(); }
搞代码网（gaodaima.com）提供的所有资源部分来自互联网，如果有侵犯您的版权或其他权益，请说明详细缘由并提供版权或权益证明然后发送到邮箱[email protected]，我们会在看到邮件的第一时间内为您处理，或直接联系QQ：872152909。本网站采用BY-NC-SA协议进行授权
转载请注明原文链接：C#查找字符串的所有排列组合
转载请注明原文链接：C#查找字符串的所有排列组合
