Java Red envelope algorithm, limited minimum and maximum critical value

Package com.cdjj.test;


public class Demo {
public static void Main (string[] args) {
Randompackage ();
}
public static void Randompackage () {
Double total_money=2;
int total_people=20;
Double min_money=5; Each person can receive at least 0.05 yuan,
Double max_money=20; Each person can receive at least 0.05 yuan,
Double lingjiezhi= (total_money/total_people) *100;
Double allresult=0;
for (int i = 0; I <total_people; i++) {
Protection value
Double procte= (total_people-i-1) *min_money/100;
Discretionary amount
Double zpje=total_money-procte;
if (Zpje*100<max_money) {
max_money=zpje*100;
}
Double Result=restround (Min_money, Max_money, I, Zpje, total_people-1);
Total_money=total_money-result;
Allresult+=result;
System.out.format ("Red envelope%.2f, balance%.2f \ \", Result,total_money);
}
System.out.format ("Total Amount%.2f", allresult);
}
public static double Restround (double min,double max,int i,double money,int count) {
Double redpac=0;
if (i==19) {
Redpac=money;
}else{
Redpac= (Math.random () * (max-min) +min)/100;
}
return REDPAC;
}
}