zoukankan      html  css  js  c++  java
  • 最简单的随机数不重复列表生成

    public class RandomOper
        {
            /// <summary>
            /// 随机生成操作类
            /// </summary>
            /// <summary>
           
            /// 打乱list列表的元素顺序
            /// </summary>
            /// <param name="list"></param>
            /// <returns></returns>
            public static List<int> Fn(List<int> list)
            {
                Random rd = new Random();
                int len = list.Count;
                for (int i = len - 1; i >= 0; i--)
                {
                    int num = list[i];
                    int n = rd.Next(0, len);
                    list[i] = list[n];
                    list[n] = num;
                }
                return list;
            }

            /// <summary>
            /// 生成从begnum到endnum的随机不重复列表
            /// </summary>
            /// <param name="begnum"></param>
            /// <param name="endnum"></param>
            /// <returns></returns>
            public static List<int> GetRandomlist(int begnum,int endnum)
            {
                List<int> retlis = new List<int>();
                List<int> slis = new List<int>();
                for (int i = begnum; i <= endnum; i++)
                {
                    slis.Add(i);
                }
                retlis = Fn(slis);
                return retlis;
            }
        }

    static void Main(string[] args)
            {
                List<int> retlis = RandomOper.GetRandomlist(1, 100);
                for (int i = 0; i < retlis.Count; i++)
                {
                    Console.Write(string.Format("retlis[{0}]:{1}----;", i, retlis[i]));
                }          

            }

  • 相关阅读:
    openssl rsa 加密
    SVN
    day04-drf认证、限流、权限、过滤、排序、分页、异常处理、自动接口文档生成、Xadmin后台管理
    day03-drf视图相关
    day02-序列化与反序列化
    day01-drf引入、序列化反序列化前序
    restFul接口设计规范
    Mysql优化之innodb_buffer_pool_size篇
    Mysql(CAST)和Oracle(to_char)应用
    Mongo和Mysql查看查询任务并终止
  • 原文地址:https://www.cnblogs.com/hujiapeng2012/p/3028791.html
Copyright © 2011-2022 走看看