zoukankan      html  css  js  c++  java
  • 一个洗牌程序算法,随机交换位置 【转】

     int[] numbers=new int [20];     //建立一个数组
                Random rand=new Random (); //生成随机数
                string result="";                    //保存结果
                for (int i = 0; i < 20; i++)       //初始化数组
                    numbers[i] = i+1;
                for (int i = 0; i < 20; i++)          //洗牌
                  {
                    int temp = rand.Next(20);
                    int tempNumber = numbers[i ];
                    numbers[i] = numbers[temp ];
                    numbers[temp] =tempNumber ;
                  }
                for (int i = 0; i < 4; i++)          //这个用来排列你想要的那4个数
                    for (int j = 0; j < 4; j++)         
                    {                                           //你不需要就去掉它
                        int temp;
                        if (numbers[i] < numbers[j])
                        {
                            temp = numbers[j];
                            numbers[j] = numbers[i];
                            numbers[i] = temp;
                        }
                        else
                            continue;
                    }                                         //生成结果项
                        for (int i = 0; i < 4; i++)
                            result += "result" + i.ToString() + "==>" + numbers[i].ToString() + Environment.NewLine;
                          MessageBox.Show(result );     //输出结果

  • 相关阅读:
    MySQL的排序方式
    Hibernate中查询优化策略
    kafka实现SASL_PLAINTEXT权限认证·集成springboot篇
    kafka实现SASL_PLAINTEXT权限认证·服务器篇
    SpringMvc服务端实现跨域请求解决方案
    maven打包日志输出优化-去掉泛型与过时的警告
    SpringMVC之控制器的单例和多例管理
    springmvc中的controller是单例的
    com.caucho.hessian.io.HessianProtocolException: is unknown code 解决方案
    浅谈大型web系统架构
  • 原文地址:https://www.cnblogs.com/Yellowshorts/p/2917090.html
Copyright © 2011-2022 走看看