php抽奖功能
在项目开发中经常会遇到花钱抽奖类型的需求。但是老板总是担心用户用小钱抽到大奖。这样会导致项目亏损。下边这段代码可以有效制止抽奖项目亏钱。
个人奖池:
语言:thinkphp redis mysql
表:desire抽奖商品表 desire_log用户抽奖奖品表 user_desire_log用户抽奖记录表 desire_risk抽奖风控表
需求:用户奖池分为进行中奖池 和已完成奖池 当用户抽到大奖后 用户个人奖池重置 否则将继续抽奖 最后一次抽奖必中大奖 通过风控金额来判断用户是否可以抽大奖
当所有用户已完成的抽奖 盈利大于风控金额的时候可以让用户抽大奖 否则用户抽不到大奖
<?php
//抽奖接口
public function desire()
{
$userData = $this->userSessionData();///用户的唯一标识
$time = time();
$this->limit_reward_time($userData['id'], $time);///限制抽奖间隔时间 防止被恶意刷奖品
//活动开启开关
$num = input('num/d');
if (!$num) {
output('1008', '参数错误');
}
if ($num!=1){
if ($num !=10){
if ($num !=100){
output('1008', '参数错误');
}else{
$send = $this->draw($num);
}
}else{
$send = $this->draw($num);
}
}else{
$send = $this->draw($num);
}
if ($send != '金币不足') {
output('200', '列表', $send);
} else {
output('1012', $send);
}
} /////抽奖核心
public function draw($num)
{
$userData = $this->userSessionData();
$resultSend = Cache::get('奖池名称加上用户的唯一标识,确保一人一奖池' . $userData['id']);//获取个人奖池
if (!empty($resultSend)) {
$userRedis = unserialize(Cache::get('newdesiredraw' . $userData['id']));///将奖池序列化
} else {
$userRedis = '';///当前用户不存在奖池
}
///查询当前用户的金币
$desireDiamonds = Db::connect('db_qmconfig')->name('user_money')->where(['uid' => $userData['id']])->field('diamonds')->find();
$sendNum = $num;
if ($desireDiamonds['diamonds'] < $num) {
return ['msg' => '金币不足'];///判断当前用户的金币是不是够抽奖
}
$gift_height = 0;///检测是否更新个人奖池和抽奖数量
$newNum = 0;///检测下一轮抽奖数量
$suiji = Db::connect('db_qmconfig')->name('desire')->order('num desc')->find();///随机小礼物
if ($userRedis) {///如果用户奖池存在
$joins = [
['gift_info f', 'd.giftid = f.id']
];
$gift = Db::connect('db_qmconfig')->name('desire')
->alias('d')
->join($joins)
->where(['d.state' => 1])
->order('f.price desc')
->field('f.name,f.price,f.egif,d.num,f.id,d.position')->find();
///查询抽奖表的礼物
if (!$gift){
return ['msg'=>'礼物查询错误'];
}
///查询用户的总抽奖数量
$user_all = Db::connect('db_qmconfig')->name('user_desire_log')->order('kind desc')
->where(['uid'=>$userData['id'],'state'=>0])->field('SUM(num) as kindNum')->find();
//十次抽奖 必中
$count = count($userRedis);
if ($num == 10) {
$where[] = ['d.state', '=', 1];
$where[] = ['d.ten', '=', 1];
$giftId = $this->giftInfo($where);
if ($giftId) {
$result[] = $giftId[0]['id'];
}
$num = $num - 1;
} ///百次抽奖 必中
if ($num == 100) {
$where[] = ['d.state', '=', 1];
$where[] = ['d.hundred', '=', 1];
$giftId = $this->giftInfo($where); $lwhere[] = ['d.state', '=', 1];
$lwhere[] = ['d.ten', '=', 1];
$lgiftId = $this->giftInfo($lwhere);
if ($lgiftId) {
for ($l=0;$l<10;$l++){
$result[] = $lgiftId[0]['id'];
}
} if ($giftId) {
$result[] = $giftId[0]['id'];
}
$num = $num - 11;
}
if ($num ==1){
if ($user_all){
$number1 = '';
$num1 = str_split($user_all['kindNum']);
$number = $num1[count($num1) - 1];
if ($user_all['kindNum']>98){
$number1 = $num1[count($num1) - 2];
}
if (($number==9)&& ($number1 !=9)){ //十抽必中
$where[] = ['d.state', '=', 1];
$where[] = ['d.ten', '=', 1];
$giftId = $this->giftInfo($where);
if ($giftId) {
$result[] = $giftId[0]['id'];
}
$num = $num - 1;
} if (($number1==9) && ($number==9)){//百抽必中
$where[] = ['d.state', '=', 1];
$where[] = ['d.hundred', '=', 1];
$giftId = $this->giftInfo($where);
if ($giftId) {
$result[] = $giftId[0]['id'];
}
$num = $num - 1;
}
}
}
////判断当前奖池的奖品是否够此次抽奖 如果奖池奖品数量不够此次抽奖 将此次奖池抽完后 获取剩下要抽将的数量 重置奖池 并且递归此方法传入剩下要抽的数量
if ($count < $num) {
$newNum = $num - $count;
$num = $count;
}
$user = Db::connect('db_qmconfig')
->name('desire_log')->where(['uid' => $userData['id']])
->field('SUM(num) as num')
->find();///已抽数量
if (!$user){
return ['msg'=>'已抽数量有误'];
}
$res['zongshu'] = Db::connect('db_qmconfig')
->name('desire')->where(['state' => 1])
->field('SUM(num) as num,checksum')
->find();///总数量
if (!$res['zongshu']){
return ['msg'=>'总数量有误'];
}
$resNum = 0;
////获取个人多少次抽奖
if (($user['num']+$sendNum) > $res['zongshu']['checksum']) {
$res['zongshu']['user_num'] = $user['num'] % $res['zongshu']['checksum']; ///获取余数
if (($res['zongshu']['user_num'] + $sendNum) > $res['zongshu']['checksum']) {
///获取这次抽奖的数量
$resNum = $sendNum - (($res['zongshu']['user_num'] + $sendNum) - $res['zongshu']['checksum']);
}
// return ['msg'=>$res['zongshu']['user_num']];
}else{
$res['zongshu']['user_num'] = $user['num'];
}
$cruuy = 0;
///随机选择奖池
for ($i = 0; $i < $num; $i++) {
$send = array_rand($userRedis);
if ($resNum > 0) {
///如果本轮奖池抽完 并且没有抽到大奖 那么必中大奖
$result[] = $gift['id'];
$gift_height = 1;//抽到大奖后更改三个变量状态
$resNum=0;
$cruuy = 1;
} else {
if ($userRedis[$send]==$gift['id']){
$haveJoin = [
['desire_log d', 'd.cid = u.id'],
['gift_info f', 'd.giftid = f.id']
];
$all = Db::connect('db_qmconfig')
->name('user_desire_log')
->alias('u')
->where(['u.state'=>1])
->field('SUM(u.num) as num')->find();
// var_dump($all);
///如果抽到大奖
if ($all['num']==null){
///如果这是整个奖池第一轮抽奖 那么可以中大奖
$result[] = $suiji['giftid'];
}else{
$alls = Db::connect('db_qmconfig')->name('user_desire_log')
->alias('u')
->where(['u.state'=>1])
->join($haveJoin)
->field('SUM(f.price*d.num) as num')->find();
///查询奖池风控金额
$reskList = Db::connect('db_qmconfig')->name('desire_risk')->find();
$riskPrice = $all['num'] * 20 - $alls['num'];
///如果风控金额小于当前已完成抽奖的金额 那么代表软件处于盈利状态 可以中大奖
if (($riskPrice >= $reskList['price'])&&($cruuy==0)){
$result[] = $userRedis[$send];
$gift_height = 1;
$cruuy = 1;
} else{
///如果风控金额大于当前已完成抽奖金额 不能中大奖 随机选择一次小奖品 替换大奖
$result[] = $suiji['giftid'];
}
} }else{
$result[] = $userRedis[$send];
}
}
///清空个人奖池此次抽奖的礼物
unset($userRedis[$send]);
}
////新增用户抽奖次数
$result = array_count_values($result);
$user_desire_list = Db::connect('db_qmconfig')->name('user_desire_log')->order('id desc')->where(['uid'=>$userData['id']])->find();
if ($user_desire_list){
if ($user_desire_list['state']==0){
$user_desire_logData[ 'kind'] = $user_desire_list['kind']+1;
}else{
$user_desire_logData[ 'kind'] = 1;
}
}else{
$user_desire_logData[ 'kind'] = 1; }
$user_desire_logData['uid'] =$userData['id'];
$user_desire_logData['ctime'] =time();
$user_desire_logData['num'] =$sendNum;
////更改此轮抽奖后 用户奖池的状态
if ($gift_height==1){
$user_desire_log_update = Db::connect('db_qmconfig')->name('user_desire_log')
->where(['uid'=>$userData['id'],'state'=>0])->update(['state'=>1]);
$user_desire_logData[ 'state'] = 1;
}else{
$user_desire_logData[ 'state'] = 0;
}
$user_desire_log = Db::connect('db_qmconfig')->name('user_desire_log')->insertGetId($user_desire_logData);
foreach ($result as $k => $v) {
if ($resNum == ($k + 1)) {
///如果这次抽奖大于奖池总数 那么更新奖池并且抽奖剩下的次数
Cache::set('newdesiredraw' . $userData['id'], serialize([]));
return $this->draw($sendNum - ($k + 1));
} ////礼物新增用户背包
$data = [
'uid' => $userData['id'],
'giftid' => $k,
'num' => $v,
'ctime' => time(),
'cid' => $user_desire_log
];
$join = [
['gift_info f', 'd.giftid = f.id']
];
$gift_info = Db::connect('db_qmconfig')->name('desire')
->alias('d')
->join($join)
->where(['d.giftid' => $k])
->field('f.name,f.egif,d.position')->find();
$gift_infonum['num'] = $v;
$list['gift'][] = array_merge($gift_info, $gift_infonum);
$desireLog = Db::connect('db_qmconfig')->name('desire_log')->insert($data);
$userKnapsack = Db::connect('db_qmconfig')->name('gift_knapsack')->where(['uid' => $userData['id'], 'giftid' => $k])->field('id,num')->find();
if ($userKnapsack) {
$userKnapsackData = [
'num' => $v + $userKnapsack['num'],
'updatetime' => time()
];
$userKnapsackUpdate = Db::connect('db_qmconfig')->name('gift_knapsack')->where(['id' => $userKnapsack['id']])->update($userKnapsackData);
} else {
$userKnapsackData = [
'num' => $v,
'giftid' => $k,
'uid' => $userData['id'],
'createtime' => time()
];
$userKnapsackInsert = Db::connect('db_qmconfig')->name('gift_knapsack')->insert($userKnapsackData);
}
}
///增加用户消费记录
$userXfData = [
'uid' => $userData['id'],
'xf_price' => $sendNum,
'xf_method' => 5,
'scene' => 19,
'status' => 1,
'ctime' => time()
];
$userXf = Db::connect('db_qmconfig')->name('xfprice')->insert($userXfData);
if ($desireLog && $userXf) {
///扣除用户金币
$newDiamondsData = [
'diamonds' => $desireDiamonds['diamonds'] - $sendNum
];
$newDiamonds = Db::connect('db_qmconfig')->name('user_money')->where(['uid' => $userData['id']])->update($newDiamondsData);
}
if ($userRedis) {
Cache::set('用户奖池名称' . $userData['id'], serialize($userRedis));
////如果此轮抽奖抽到大奖 重置用户个人奖池
if ($gift_height == 1) {
Cache::set('用户奖池名称' . $userData['id'], serialize([]));
$userChecksum = $res['zongshu']['checksum'] - ($res['zongshu']['user_num'] + $sendNum);
$desireLogUserWhere = [
'uid' => $userData['id'],
'giftid' => 0,
'num' => $userChecksum,
'ctime' => time(),
'cid' => $user_desire_log,
];
///添加礼物抽中记录
$desireLogUser = Db::connect('db_qmconfig')->name('desire_log')->insert($desireLogUserWhere);
}
$swhere[] = ['d.state', '=', 1];
$swhere[] = ['d.kind', '=', 1];
$res['data'] = $this->giftInfo($swhere);
if (empty($res['data'])) {
output('1008', '奖池更新中');
}
////获取用户此轮抽奖数量 返回给前端 控制奖池动画百分比
$res['zongshu'] = Db::connect('db_qmconfig')
->name('desire')->where(['state' => 1, 'kind' => 1])
->field('checksum as num')
->find();
$user = Db::connect('db_qmconfig')
->name('desire_log')->where(['uid' => $userData['id']])
->field('SUM(num) as num')
->find();
$res['diamonds'] = Db::connect('db_qmconfig')
->name('user_money')->where(['uid' => $userData['id']])
->value('diamonds'); if ($user) {
if ($user['num'] > $res['zongshu']['num']) {
$res['zongshu']['user_num'] = $user['num'] % $res['zongshu']['num']; } else {
$res['zongshu']['user_num'] = $user['num'];
}
} else {
$res['zongshu']['user_num'] = 0;
}
$list['info'] = $res;
return $list;
// return ['msg'=>$res['zongshu']['user_num']];
} else {
////如果当前用户奖池抽完奖了 那么重置此用户奖池
$where[] = ['d.state', '=', 1];
$where[] = ['d.kind', '=', 1];
$res = $this->giftInfo($where);
if (empty($res)) {
return ['msg' => '奖池更新中'];
}
$c = [];
foreach ($res as $m => $n) {
///十抽必中奖品
if ($n['ten']==1){
$n['num'] = $n['num'] - $n['checksum']/10;
$giftarr = array_fill(0, $n['num']+$n['checksum']/10, $suiji['giftid']);
$c = array_merge($c, $giftarr);
if ($n['num']<=0){
continue;
}
}
///百抽必中奖品
if ($n['hundred']==1){
$n['num'] = $n['num'] - $n['checksum']/100;
$giftarr = array_fill(0, $n['num']+$n['checksum']/100, $suiji['giftid']);
$c = array_merge($c, $giftarr);
if ($n['num']<=0){
continue;
}
}
$giftarr = array_fill(0, $n['num'], $n['id']);
$c = array_merge($c, $giftarr);
}
///随机打乱奖池
shuffle($c);
Cache::set('用户奖池名称' . $userData['id'], serialize($c));
if ($newNum>0){
///递归此方法 抽剩下的奖品
return $this->draw($newNum);
}
}
} else {
///如果没有奖池 生成奖池
$where[] = ['d.state', '=', 1];
$where[] = ['d.kind', '=', 1];
$res = $this->giftInfo($where);
if (empty($res)) {
return ['msg' => '奖池更新中'];
}
$c = [];
foreach ($res as $m => $n) {
if ($n['ten']==1){
$n['num'] = $n['num'] - $n['checksum']/10;
$giftarr = array_fill(0, $n['num']+$n['checksum']/10, $suiji['giftid']);
$c = array_merge($c, $giftarr);
if ($n['num']<=0){
continue;
}
}
if ($n['hundred']==1){
$n['num'] = $n['num'] - $n['checksum']/100;
$giftarr = array_fill(0, $n['num']+$n['checksum']/100, $suiji['giftid']);
$c = array_merge($c, $giftarr);
if ($n['num']<=0){
continue;
}
}
$giftarr = array_fill(0, $n['num'], $n['id']);
$c = array_merge($c, $giftarr);
}
shuffle($c);
Cache::set('用户奖池名称' . $userData['id'], serialize($c));
///递归此方法抽奖
return $this->draw($num);
}
}
?>
php抽奖功能的更多相关文章
- jquery实现简单抽奖功能
一直纠结要怎么用jquery实现抽奖功能,看别人很多都是用flash制作的,找了很多资料,最终找到一个比较适合需求的,我做了些许调整,以下是代码展示(复制下来可以直接使用). 先上图:
- 手摸手。完成一个H5 抽奖功能
要完成一个这样的抽奖功能 构思 奖励物品是通过接口获取的(img) 奖励结果是通过接口获取的(id) 抽奖的动画需要由慢到快再到慢 抽奖转动时间不能太短 抽奖结束需要回调 业务代码和功能代码要分离 先 ...
- Jmeter使用CSV Data Set Config参数化数据不重复的多次循环执行(实现多用户多次抽奖功能)
Jmeter中使用CSV Data Set Config参数化不重复数据执行N遍 要求: 今天要测试上千条数据,且每条数据要求执行多次,(模拟多用户多次抽奖) 1.用户id有175个,且没有任何排序规 ...
- javascript平时小例子⑨(小型抽奖功能)
<!doctype html><html lang="en"> <head> <meta charset="utf-8" ...
- JS抽奖功能代码
HTML <label for="awardListDom">奖项列表</label><br> <input type="tex ...
- 基于VUE的九宫格抽奖功能
HTML代码: <template> <div class="luckDraw"> <title-bar :title="title&quo ...
- Js原生实现抽奖功能
<div>代码 按钮代码 JS原生代码 完整的代码: <div style="width:365px;height:300px;border:2px solid gree ...
- android传感器;摇抽奖功能
package com.kane.sensortest; import java.util.Random; import android.hardware.Sensor; import android ...
- HTML+JavaScript实现一个简单抽奖功能
为什么会做这个东西呢,纯属好玩,闲的其实是在上次班会的时候想到的,班会的时候叫人回答问题,没人回答当时就想,我如果抽签抽到你了,你还是不回答吗??好吧,一切都是扯淡先来看看页面效果吧:点击抽取就可以抽 ...
随机推荐
- ASP.NET实现一个在线音乐统计网站(歌手,音乐,角色……增删改查)
这里更多的是当作随身笔记使用,记录一下学到的知识,以便淡忘的时候能快速回顾 当前步骤是该项目的完结部分(前面由于没有时间整理了,直接发一个大完结吧) 第一部分 第二部分 源码已上传GitHub:这里有 ...
- Java实现 LeetCode 321 拼接最大数
321. 拼接最大数 给定长度分别为 m 和 n 的两个数组,其元素由 0-9 构成,表示两个自然数各位上的数字.现在从这两个数组中选出 k (k <= m + n) 个数字拼接成一个新的数,要 ...
- Java实现 LeetCode 226 翻转二叉树
226. 翻转二叉树 翻转一棵二叉树. 示例: 输入: 4 / \ 2 7 / \ / \ 1 3 6 9 输出: 4 / \ 7 2 / \ / \ 9 6 3 1 备注: 这个问题是受到 Max ...
- Java实现 蓝桥杯VIP 算法提高 3-2字符串输入输出函数
算法提高 3-2字符串输入输出函数 时间限制:1.0s 内存限制:512.0MB 描述 编写函数GetReal和GetString,在main函数中分别调用这两个函数.在读入一个实数和一个字符串后,将 ...
- 第八届蓝桥杯JavaA组省赛真题
解题代码部分来自网友,如果有不对的地方,欢迎各位大佬评论 题目1.迷宫 题目描述 X星球的一处迷宫游乐场建在某个小山坡上. 它是由10x10相互连通的小房间组成的. 房间的地板上写着一个很大的字母. ...
- TZOJ 数据结构实验--静态顺序栈
描述 创建一个顺序栈(静态),栈大小为5.能够完成栈的初始化.入栈.出栈.获取栈顶元素.销毁栈等操作. 顺序栈类型定义如下: typedef struct { int data[Max]; i ...
- CMDB 和自动化运维
目录 传统运维和自动化运维的对比 CMDB CMDB 的几种实现方式 传统运维和自动化运维的对比 1.企业中,项目的发布流程 产品经理调研需求 -->三方开会讨论(开发,产品,运维,测试) -– ...
- protobuf安装流程
protobuf安装流程 环境 平台 Ubuntu16.04 依赖 autoconf automake libtool curl make g++ 安装流程 在Ubuntu / Debian上,您 ...
- ios支付签名认证
一.解析json中参数的含义 private Long id; @ApiModelProperty(value = "创建时间") private Date gmtCreate; ...
- activeMQ从入门到简单集群指南
1.什么是amq MQ是消息中间件,基于JAVA的JMS消息服务机制来传递信息. 2.mq的作用 MQ给程序之间提供了一个缓冲,避免了在程序交互频繁的情况下,提高程序性能瓶颈和数据的可靠性 3.mq怎 ...