• 使用redis队列抽奖


    using ServiceStack.Redis;
    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;
    using System.Threading.Tasks;

    namespace 练习rides
    {
    class Program
    {
    static void Main(string[] args)
    {
    //设置金额
    double totalAmount = 100;
    //设置个数
    int num = 10;
    //保底金额
    double minAmount = 0.01;
    //redis连接
    RedisClient client = new RedisClient("127.0.0.1", 6379);
    //队列
    Queue<double> qu = new Queue<double>();
    //随机数
    Random r = new Random();
    //循环
    for (int i = 1; i < num; i++)
    {
    //
    //(总金额-(总人数-第一个人)*最小金额)/(总人数-第一个人)
    //安全金额
    double safeAmount = (totalAmount - (num - i) * minAmount) / (num - i);
    double money = NextDouble(r, minAmount * 100, safeAmount * 100) / 100;
    money = Math.Round(money, 2, MidpointRounding.AwayFromZero);
    totalAmount = totalAmount - money;
    totalAmount = Math.Round(totalAmount, 2, MidpointRounding.AwayFromZero);
    //添加队数据
    qu.Enqueue(money);
    Console.WriteLine("第" + i + "个红包:" + money + " 元,余额:" + totalAmount + " 元");
    }
    Console.WriteLine("第" + num + "个红包:" + totalAmount + " 元,余额:0 元");
    qu.Enqueue(totalAmount);
    client.Add<Queue<double>>("key", qu);
    //模拟,当点击抢
    //Queue<double> que = client.Get<Queue<double>>("key");

    for (int i = 1; i <= num+1; i++)
    {
    if (qu.Count > 0)
    {
    double am = qu.Dequeue();
    //var t = new { name = "123213", amount = am, date = DateTime.Now };
    Console.WriteLine("第" + i + "个金额是" + am);
    }
    else
    {
    Console.WriteLine("已抢完");
    }
    }


    Console.ReadKey();


    }
    /// <summary>
    /// 生成设置范围内的Double的随机数
    /// eg:_random.NextDouble(1.5, 2.5)
    /// </summary>
    /// <param name="random">Random</param>
    /// <param name="miniDouble">生成随机数的最大值</param>
    /// <param name="maxiDouble">生成随机数的最小值</param>
    /// <returns>当Random等于NULL的时候返回0;</returns>
    protected static double NextDouble(Random random, double miniDouble, double maxiDouble)
    {
    if (random != null)
    {
    return random.NextDouble() * (maxiDouble - miniDouble) + miniDouble;
    }
    else
    {
    return 0.0d;
    }
    }
    }
    }

  • 相关阅读:
    openldap---ldapsearch使用
    自旋锁与相互排斥锁之抉择
    探索Android中的Parcel机制(上)
    我的Android开发相关文章
    SoftReference
    Windows7WithSP1/TeamFoundationServer2012update4/SQLServer2012
    机器学习中规则化和模型选择知识
    Java中System的详细用法
    Java中System的详细用法
    Java中System的详细用法
  • 原文地址:https://www.cnblogs.com/kongjie/p/13215950.html
Copyright © 2020-2023  润新知