zoukankan      html  css  js  c++  java
  • PHP抽奖代码。亲测可用

    $prize_arr = array( 
        '0' => array('id' => 1, 'title' => 'iphone5s', 'v' => 5), 
        '1' => array('id' => 2, 'title' => '联系笔记本', 'v' => 5), 
        '2' => array('id' => 3, 'title' => '音箱设备', 'v' => 5), 
        '3' => array('id' => 4, 'title' => '30GU盘', 'v' => 5), 
        '4' => array('id' => 5, 'title' => '话费50元', 'v' => 5), 
        '5' => array('id' => 6, 'title' => 'iphone6s', 'v' => 1), 
        '6' => array('id' => 7, 'title' => '谢谢,继续加油哦!~', 'v' => 80), 
    ); 
     
    foreach ($prize_arr as $key => $val) { 
        $arr[$val['id']] = $val['v']; 
    } 
     //$arr= [1=>'phone',2=>'note']
    
    $prize_id = getRand($arr); //根据概率获取奖品id 
    $data['msg'] = ($prize_id == 7) ? 0 : 1; //如果为0则没中  
    $data['prize_title'] = $prize_arr[$prize_id - 1]['title']; //中奖奖品 
    echo json_encode($data); 
    exit; //以json数组返回给前端 
     
    function getRand($proArr) { //计算中奖概率 
        $rs = ''; //z中奖结果 
        $proSum = array_sum($proArr); //概率数组的总概率精度 
        //概率数组循环 
        foreach ($proArr as $key => $proCur) { 
            $randNum = mt_rand(1, $proSum); 
            if ($randNum <= $proCur) { 
                $rs = $key; 
                break; 
            } else { 
                $proSum -= $proCur; 
            } 
        } 
        unset($proArr); 
        return $rs; 
    }
    

      

  • 相关阅读:
    信息收集
    beef框架使用
    网站程序CMS识别
    查找网站后台
    下载漏洞原理及利用
    后台拿webshell方法(2)
    如何学好web安全
    TIME_WAIT过多的解决方法(转)
    sudo
    keepalived+lvs子网掩码造成VIP切换故障 + vrrp_script+track_script
  • 原文地址:https://www.cnblogs.com/bing2017/p/11669842.html
Copyright © 2011-2022 走看看