{
Array.Sort(args);//升序
Array.Reverse(args);//取反变倒叙
List<int> List2 = new List<int>(args);//整型数组转list
for (int i = 0; i < List2.Count; i++)
{
List<int> List3 = new List<int>();
List3.Add(List2[i]);
List2.RemoveAt(i);
for (int j = 0; j < List2.Count; j++)
{
if ((int)List2[j] <= argsum - Count(List3) - 0.5)
{
List3.Add(List2[j]);
List2.RemoveAt(j);
j = -1;
}
}
string strArray = string.Join(",",List3);
MessageBox.Show(strArray);//即为每次分组的结果。
i = -1;}
}
public static int Count(List<int> list)
{
int sum = 0;
for (int i = 0; i < list.Count(); i++)
{
sum += list[i];
}
return sum;
}
返回结果可用结果集来接收:
public static Dictionary<int, List<int>> Sort(int[] args, int argsum)//数组。和
{
Dictionary<int, List<int>> List = new Dictionary<int, List<int>>();
Array.Sort(args);//升序
Array.Reverse(args);//取反变倒叙
List<int> List2 = new List<int>(args);//整型数组转list
int count = 0;//List中元素键
for (int i = 0; i < List2.Count; i++)
{
List<int> List3 = new List<int>();
List3.Add(List2[i]);
List2.RemoveAt(i);
for (int j = 0; j < List2.Count; j++)
{
if ((int)List2[j] <= argsum - Count(List3)-0.5)
{
List3.Add(List2[j]);
List2.RemoveAt(j);
j = -1;
}
}
List.Add(count++, List3);
i = -1;
}
return List;
}
public static int Count(List<int> list)
{
int sum = 0;
for (int i = 0; i < list.Count(); i++)
{
sum += list[i];
}
return sum;
}
调用方法:
String[] temp = textEdit_input.Text.Split(',');
int[] ints = new int[temp.Length];//int类型数组
for (int i = 0; i < temp.Length; i++)
{
ints[i] = Convert.ToInt32(temp[i]);//整数数组
}
int len = Convert.ToInt32(textEdit_lengh.Text);
Dictionary<int, List<int>> reslist = Sort(ints, len);
for (int i = 0; i < reslist.Count(); i++)
{
string str = "";
for (int j = 0; j < reslist[i].Count(); j++)
{
str += reslist[i][j] + ",";
}
textEdit_output.Text += str + "\r\n";
}