C#实现拼手气红包算法

static double[] GetRandomMoney(double money, int n)
 {
  double[] array = new double[n];
  RedPackage red = new RedPackage() { money = money, count = n };
  for (int i = 0; i < n; i++)
  {
   array[i] = GetRandomMoney(red);
  }
  return array;
 }
 /// <summary>
 /// 即开即中，考虑机会均等，减少金额差较大的几率
 /// 随机产生，额度在0.01和剩余平均值*2之间
 /// </summary>
 /// <returns></returns>
 static double GetRandomMoney(RedPackage redPackage)
 {
  //如果最后一个，返回全部
  if (redPackage.count == 1)
  {
   redPackage.count--;
   return Math.Round(redPackage.money * 100) / 100.00;
  }
  //随机生成
  Random ran = new Random();
  double min = 0.01;
  double max = redPackage.money / redPackage.count * 2;
  double money = ran.NextDouble() * max;
 
  money = money <= min ? 0.01 : money;
  money = Convert.ToInt32(money * 100) / 100.00;
  redPackage.count--;
  redPackage.money -= money;
  return money;
 }
 public class RedPackage
 {
  /// <summary>
  /// 剩余红包数量
  /// </summary>
  public int count;
  /// <summary>
  /// 剩余金额
  /// </summary>
  public double money;
 }

/// <summary>
/// 一次性拆分红包，不考虑机会平等性
/// 最小单位1 分
/// </summary>
 static double[] DiviedOne(double money, int n)
 {
 
  double min = 0.01;
  if (money < min)
   throw new Exception("拆分金额不能小于0.01 ");
  int fen = (int)money * 100;
  //创建n 个红包数组
  int[] array = new int[n];
  //每个红包先填充1分
  Array.Fill(array, 1);
  fen -= n;
 
  //第二步，随机分配
  Random ran = new Random();
  int i = 0;
  while (fen > 1)
  {
   int f = ran.Next(fen);
   array[i % n] += f;
   fen -= f;
   i++;
  }
  //最后一分钱，补到第一个数组
  if (fen > 0)
  {
   array[0] += fen;
  }
 
  return array.Select(q => q / 100.0).ToArray();
 }