上班走神就玩玩算法!发红包：填充法+隔板法

1.填充法

    /**
     * 分红包-填充法
     * @param money 金额
     * @param num 红包数
     * @return
     */
    private static int[] createHongBaosV1(int money,int num){
        int[] hongBaos = new int[num];
        //每个包先填充1分钱避免空包
        Arrays.fill(hongBaos,1);
        money-=num;
        Random r = new Random();
        while (money>0){
            //根据剩余钱产生随机金额放入随机的红包中（靠前的随机数为大数概率较大,且可能某个红包多次放入,故该算法易导致红包分配不均匀）
            int randomMoney = r.nextInt(money) + 1;
            int hongBaoIndex = r.nextInt(hongBaos.length);
            hongBaos[hongBaoIndex]+=randomMoney;
            money-=randomMoney;
        }
          return hongBaos;
    }

2.隔板法（推荐）

  /**
     * 分红包-隔板法
     * @param money 金额
     * @param num 红包数
     * @return
     */
    private static int[] createHongBaosV2(int money,int num) throws InterruptedException {
        int[] hongBaos = new int[num];
        //需要的板数
        int boardNum=num-1;
        //将隔板放入放入优先级队列
        PriorityBlockingQueue<Integer> queue = new PriorityBlockingQueue<>(boardNum,(o1, o2) -> o1-o2);
        Random r = new Random();
        while (queue.size()<boardNum){
            int randomBoard = r.nextInt(money-1)+1;
            queue.offer(randomBoard);
        }
        int len=0;
        System.out.println(queue);
        //由小到大出队,差值即为红包值，如[17, 41, 27, 61, 51, 34, 58, 94, 71]
        for (int i = 0; i <boardNum; i++) {
            Integer ele = queue.take();
            hongBaos[i]= ele-len;
            len=ele;

        }
        //最后一个红包
        hongBaos[num-1]=money-len;
        return hongBaos;
    }

3.分红包测试

 public static void main(String[] args) throws InterruptedException {
        for (int i = 0; i < 10; i++) {
           //int[] hongBaos = createHongBaosV1(100, 10);
          int[] hongBaos = createHongBaosV2(100,10);
            for (int hongBao : hongBaos) {
                System.out.println(hongBao);
            }
            System.out.println("************************华丽分割线************************");
        }

    }