33选6算法:M个数N个为一组,无重复的排列组合
2024-09-15 17:39:44
private void button1_Click(object sender, EventArgs e)
{
int nCnt = 0;
List nNumList = new List();
for (int i = 0; i < cblNumList.Items.Count; i++)
{
if (cblNumList.GetItemChecked(i))
{
nNumList.Add(Convert.ToInt32(cblNumList.Items[i].ToString()));
}
}
System.Text.StringBuilder sbResult = new StringBuilder();
int nLast = nNumList.Count;
for (int i1 = 0; i1 < nLast-5; i1++)
{
for (int i2 = 0; i2 < nLast - 4; i2++)
{
if (i2 == i1) continue;
for (int i3 = 0; i3 < nLast - 3; i3++)
{
if (i3 == i2 || i3 == i1) continue;
for (int i4 = 0; i4 < nLast - 2; i4++)
{
if (i4 == i3 || i4 == i2 || i4 == i1) continue;
for (int i5 = 0; i5 < nLast - 1; i5++)
{
if (i5 == i4 || i5 == i3 || i5 == i2 || i5 == i1) continue;
for (int i6 = 0; i6 < nLast; i6++)
{
if (i6 == i5 || i6 == i4 || i6 == i3 || i6 == i2 || i6 == i1) continue;
if (nNumList[i1] > nNumList[i2] || nNumList[i2] > nNumList[i3] || nNumList[i3] > nNumList[i4] || nNumList[i4] > nNumList[i5] || nNumList[i5] > nNumList[i6]) continue;
sbResult.Append("\r\n" + nNumList[i1].ToString() + " " + nNumList[i2].ToString() + " " + nNumList[i3].ToString() + " " + nNumList[i4].ToString() + " " + nNumList[i5].ToString() + " " + nNumList[i6].ToString());
nCnt += 1;
}
}
}
}
}
}
tbResult.Text = sbResult.ToString();
//lblMessage.Text = nLast + " 个随机数字；共有 " + nCnt + " 条记录";
}
最新文章
- 【原创分享·支付宝支付】HBuilder打包APP调用支付宝客户端支付
- C# 读取EXCEL文件的三种经典方法
- Making the Grade(POJ3666)
- CentOS7 监控进程网络流量工具安装
- 20145226夏艺华 《Java程序设计》第0周学习总结
- 在Salesforce中调用外部系统所提供的的Web Service
- 搭建angular前端框架 命令
- PHP vs Python
- excel读取 工具类
- 关于MapReduce单词统计的例子:
- RGB的三维模型与渐变色-颜色系列之一
- angularjs现学现记之—$apply()和$digest()
- 使用Win32 API创建不规则形状&带透明色的窗口
- Android学习路径——Android的四个组成部分activity（一）
- java集合的操作(set,Iterator)
- 排序算法（二）Sort with Swap(0,*)
- 3.认识Angular2组件之1
- 破解某普通话测试app会员
- Docker EE 安装 on centos7
- THEKEY