随机算法

1.随机洗牌原理：

假如数组长度 len,遍历len-1次，每次在[i,len-1] 随机一个值，跟第i个元素交换位置。循环完毕，数组所有位置的元素都是随机值。

2.代码：

public int[] ShuffleCard(int[] arr)
{
    for (int i = 0; i < arr.Length; i++)
    {
        int ranIdx = UnityEngine.Random.Range(i, arr.Length);//获取随机索引
        int temp = arr[i];
        arr[i] = arr[ranIdx];
        arr[ranIdx] = temp;
    }
    return arr;
}

3.带权重随机代码：

3.1 m选1

    public static int RandomWeight(int[] weights)
    {
        int weightSum = weights.Sum();//得到所有权重的总和
        int randomValue = UnityEngine.Random.Range(0, weightSum);
        int sum = 0;
        //判断随机值 在哪个区间
        for (int i = 0; i < weights.Length - 1; i++)
        {
            sum += weights[i];
            if (sum >= randomValue)
                return i;
        }
        return 0;
    }

3.2 m选n

  /// <summary>
    /// 带权重的随机m选n
    /// </summary>
    /// <param name="weights">权重值列表</param>
    /// <param name="count">随机抽取条数</param>
    /// <returns>随机选择的索引列表</returns>
    public static List<int> GetRandomWeightList(float[] weights, int count)
    {
        if (weights == null || weights.Length <= count || count <= 0)
            return null;

        float totalWeights = weights.Sum(t => t + 1);//得到所有权重的总和

        //Key=>int为权重值列表下标索引、Value=>int为权重排序值
        List<KeyValuePair<int, float>> wlist = new List<KeyValuePair<int, float>>();    
        for (int i = 0; i < weights.Length; i++)
        {
            float w = (weights[i] + 1) + UnityEngine.Random.Range(0, totalWeights);//（权重+1）+ 从0到（总权重）的随机数
            wlist.Add(new KeyValuePair<int, float>(i, w));
        }

        //降序排序
        wlist.Sort((a, b)=>-a.Value.CompareTo(b.Value));
  
        //根据实际情况取排在最前面的几个
        List<int> newList = new List<int>();
        for (int i = 0; i < count; i++)
            newList.Add(wlist[i].Key);

        return newList;
    }

3.3 测试

    void Start()
    {
        float[] weights=new float[]{10,30,50,80,100};
        int x = 0;
        for (int i = 0; i < 100000; i++)
        {
            int value = GetRandomWeightedIndex(weights);
            if (value > 2)
                x++;
        }

        Debug.Log(x);
        x = 0;
        Debug.LogWarning("-------------");

        for (int i = 0; i < 100000; i++)
        {
            var list = GetRandomWeightList(weights, 1);
            x += list.Count(t => t > 2);
        }
        Debug.Log(x);
    }

3.4 总结

2种带权重的随机 的概率是差不多的。大量测试结果表明：随机结果和值的权重占权重总值的概率有关，比例越大，可能性越大。如100权重占总权重270的 37%=》100000次测试 37126次被随机到。

4.M取N 随机取K个不重复的数：

    public static List<T> Random<T>(IList<T> range, int count)
    {
        int listcount = range.Count;
        List<T> callback = new List<T>(count);
        for (int i = 0; i < count; i++)
        {
            int randomMax = listcount - i;
            int index = UnityEngine.Random.Range(0, randomMax);
            callback.Add(range[index]);

            //将结果放置集合后面
            var temp = range[randomMax - 1];
            range[randomMax - 1] = range[index];
            range[index] = temp;
        }
        return callback;
    }