C#中字典的排列

Question

我有一本包含键和值的字典。我正在尝试获取所有可能的键组合而不重复。所以 AB 和 BC 和 CDE 但不是 BA。这些值此时并不重要，稍后我将使用它们。我该怎么做？

Dictionary<string, int> datadict = new Dictionary<string, int>();

datadict.Add("A", 310);
datadict.Add("B", 200);
datadict.Add("C", 510);
datadict.Add("D", 340);
datadict.Add("E", 230);
datadict.Add("F", 940);
datadict.Add("G", 470);
datadict.Add("H", 430);
datadict.Add("I", 440);
datadict.Add("J", 360);

Answer 1

可能有一些LINQ 和for-loops

使用LINQ将密钥集提取为array

var KeyList = datadict.Select(r => r.Key).ToArray();

示例程序：2个字符的组合

// Keys are extracted from Dictionary : A String Array
var KeyList = datadict.Select(r => r.Key).ToArray();
// Values are extracted from Dictionary : An int Array
var ValueList = datadict.Select(r => r.Value).ToArray();

// Here I have provided a simple algorithm to get Combinations of Two characters
// Ex : AB , AC ... 
// Does not get AA. BB .. OR BA, CA..

int res=0;
// Outer Loop walk through all elements
for (int i = 0; i < KeyList.Length; i++)
{
     // Inner loop walk from outer loop index +1 
     for (int j = i+1; j < KeyList.Length; j++)
     {
          // Find the SUM 
          res=ValueList[i]+ValueList[j];

          // Permutations and the SUM
          Console.WriteLine(KeyList[i]+KeyList[j]+"  "+res);
     }
}

输出：

AB
AC
AD
.
.
IJ