PHP随机红包算法

 1 function randBean($total_bean, $total_packet)
 2 {
 3     $cp_total_bean = $total_bean;
 4     $cp_total_packet = $total_packet;
 5     
 6     $arr = [];
 7     $min = 1;
 8     while($total_packet > 1){
 9         $max = floor($total_bean / $total_packet) * 2;
10         $bean = rand($min, $max);
11         
12         $arr[] = $bean;
13         
14         $total_bean -= $bean;
15         $total_packet--;
16     }
17     
18     $arr[] = $total_bean;//剩余的豆作为最后一个红包
19     if ($total_bean == 0) { //防止出现最后一个红包金额为0的情况, 递归, 10万次中大概有1000多次出现这种情况
20         return randBean($cp_total_bean, $cp_total_packet);
21     } else {
22         return $arr;
23     }
24 }