function randBean($total_bean, $total_packet)

 {

     $min_bean = 1;

     $max_bean = 5000;

     $range = 2;

     $total_bean = $total_bean - $total_packet * $min_bean; //每个人预留一个最小值

     $list = [];

     $min = 1;

     while(count($list) < $total_packet){

         $max = floor($total_bean / $total_packet) * $range;

         $bean = rand($min, $max);

         if ($bean <= $max_bean - 1) {

             $list[] = $bean;

             $total_bean -= $bean;

         }

     }

     $list[] = $total_bean;//剩余的金豆作为最后一个红包

     //合并

     foreach ($list as $k => $v) {

         $list[$k] += $min_bean;

     }

     return $list;

 }

 function abc ($total_bean, $total_packet)

 {

     $min = 1;

     $max = $total_bean -1;

     $list = [];

     $maxLength = $total_packet - 1;

     while(count($list) < $maxLength) {

         $rand = mt_rand($min, $max);

         empty($list[$rand]) && ($list[$rand] = $rand);

     }

     $list[0] = 0; //第一个

     $list[$total_bean] = $total_bean; //最后一个

     sort($list); //不再保留索引

     $beans = [];

     for ($j=1; $j<=$total_packet; $j++) {

         $beans[] = $list[$j] - $list[$j-1];

     }

     // return $beans;

     echo '<pre>'; print_r($beans); echo array_sum($beans);

 }

 abc(100000, 3);