zoukankan      html  css  js  c++  java
  • C# 按照比重来随机 [搬运微调]

    原文地址

    本文章时在原文章基础上添加了一丢丢测试代码

    ***用途,按照比重来进行随机

    测试代码:

     int viewCount1 = 0;
                int viewCount0 = 0;
    
                for (int i = 0; i < 5000; i++)
                {
                    List<GameItemRandomObject> shuidiRanObj = new List<GameItemRandomObject>();
                    shuidiRanObj.Add(new GameItemRandomObject() { item = 0, Weight = 15 });
                    shuidiRanObj.Add(new GameItemRandomObject() { item = 1, Weight = 10 });
                    var obj = GetRandomList<GameItemRandomObject>(shuidiRanObj, 1)[0].item;
                    if (obj.Equals(1)) viewCount1 += 1;
                    if (obj.Equals(0)) viewCount0 += 1;
                }
                Console.WriteLine($"五千次测试结果: 0比重15共出现{viewCount0}次,1比重10共出现{viewCount1}次");

    以下是原文代码:

     /// <summary>
        /// 权重对象
        /// </summary>
        public class RandomObject
        {
            /// <summary>
            /// 权重
            /// </summary>
            public int Weight { set; get; }
        }
        public class GameItemRandomObject : RandomObject
        {
            public int item { get; set; }
        }
            /// <summary>
            /// 带权重的随机
            /// </summary>
            /// <param name="list">原始列表</param>
            /// <param name="count">随机抽取条数</param>
            /// <returns></returns>
            public static List<T> GetRandomList<T>(List<T> list, int count) where T : RandomObject
            {
                if (list == null || list.Count <= count || count <= 0)
                {
                    return list;
                }
    
                //计算权重总和
                int totalWeights = 0;
                for (int i = 0; i < list.Count; i++)
                {
                    totalWeights += list[i].Weight + 1;  //权重+1,防止为0情况。
                }
    
                //随机赋值权重
                System.Random ran = new System.Random(GetRandomSeed());  //GetRandomSeed()随机种子,防止快速频繁调用导致随机一样的问题 
                List<KeyValuePair<int, int>> wlist = new List<KeyValuePair<int, int>>();    //第一个int为list下标索引、第一个int为权重排序值
                for (int i = 0; i < list.Count; i++)
                {
                    int w = (list[i].Weight + 1) + ran.Next(0, totalWeights);   // (权重+1) + 从0到(总权重-1)的随机数
                    wlist.Add(new KeyValuePair<int, int>(i, w));
                }
    
                //排序
                wlist.Sort(
                  delegate (KeyValuePair<int, int> kvp1, KeyValuePair<int, int> kvp2)
                  {
                      return kvp2.Value - kvp1.Value;
                  });
    
                //根据实际情况取排在最前面的几个
                List<T> newList = new List<T>();
                for (int i = 0; i < count; i++)
                {
                    T entiy = list[wlist[i].Key];
                    newList.Add(entiy);
                }
    
                //随机法则
                return newList;
            }
            /// <summary>
            /// 随机种子值
            /// </summary>
            /// <returns></returns>
            private static int GetRandomSeed()
            {
                byte[] bytes = new byte[4];
                System.Security.Cryptography.RNGCryptoServiceProvider rng = new System.Security.Cryptography.RNGCryptoServiceProvider();
                rng.GetBytes(bytes);
                return BitConverter.ToInt32(bytes, 0);
            }
  • 相关阅读:
    Object C学习笔记25-文件管理(一)
    实施项目--为什么开发人员一直在抱怨需求变动
    Git.Framework 框架随手记--准备工作
    一网打尽!2018网络安全事件最全的盘点
    林纳斯·托瓦兹和Linux行为准则:揭穿7个谬论
    LinkedList源码解析
    四种List实现类的对比总结
    HashMap源码解析
    volatile
    Java内存模型与共享变量可见性
  • 原文地址:https://www.cnblogs.com/ncellit/p/13657660.html
Copyright © 2011-2022 走看看