//二倍均值法
public static List<Integer> divideRedPackage(Integer totalAmount,
             Integer totalPeopleNum) {
  List<Integer> amountList = new ArrayList<Integer>();
 
  //為了使用random.nextInt(Integer)方法不得不先把紅包金額放大100倍，最后在main函數(shù)里面再除以100
  //這樣就可以保證每個(gè)人搶到的金額都可以精確到小數(shù)點(diǎn)后兩位
 
  Integer restAmount = totalAmount * 100;
 
  Integer restPeopleNum = totalPeopleNum;
 
  Random random = new Random();
 
  for (int i = 0; i < totalPeopleNum - 1; i++) {
 
   // 隨機(jī)范圍：[1，剩余人均金額的兩倍)，左閉右開
 
   int amount = random.nextInt(restAmount / restPeopleNum * 2 - 1) + 1;
   restAmount -= amount;
   restPeopleNum--;
   amountList.add(amount);
  }
  amountList.add(restAmount);
 
  return amountList;
 }

//線段分割法
private static List<Integer> divide(double money, int n) {
  //驗(yàn)證參數(shù)合理校驗(yàn)
  //為了使用random.nextInt(Integer)方法不得不先把紅包金額放大100倍，最后在main函數(shù)里面再除以100
  //這樣就可以保證每個(gè)人搶到的金額都可以精確到小數(shù)點(diǎn)后兩位
  int fen = (int) (money * 100);
  if (fen < n || n < 1) {
   System.out.println("紅包個(gè)數(shù)必須大于0，并且最小紅包不少于1分");
  }
  List<Integer> boards = new ArrayList<>();
  boards.add(0);
  boards.add(fen);
  //紅包個(gè)數(shù)和板磚個(gè)數(shù)的關(guān)系
  while (boards.size() <= n) {
   int index = new Random().nextInt(fen - 1) + 1;
   if (boards.contains(index)) {
    //保證板子的位置不相同
    continue;
   }
   boards.add(index);
  }
 
  //計(jì)算每個(gè)紅包的金額，將兩個(gè)板子之間的錢加起來
  Collections.sort(boards);
  List<Integer> list = new ArrayList<>();
  for (int i = 0; i < boards.size() - 1; i++) {
   Integer e = boards.get(i + 1) - boards.get(i);
   list.add(e);
  }
  return list;
 
 }
 public static void main(String[] args) {
//  List<Integer> accountList = divideRedPackage(50, 1000);
  List<Integer> accountList = divide(50, 10);
  BigDecimal count = new BigDecimal(0);
  for (Integer amount : accountList) {
   //將搶到的金額再除以100進(jìn)行還原
   BigDecimal tmpcount = new BigDecimal(amount).divide(new BigDecimal(100));
   count = count.add(tmpcount);
   System.out.println("搶到金額：" + tmpcount);
 
  }
  System.out.println("total=" + count);
}