Java实现微信红包随机金额算法
package com.joincheer.jcp.utils;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
public class RandSplitNumUtils {
private static final Random random = new Random();
public static List<Integer> genRandList(int total, int splitNum, int min, int max) {
return genRandList(total, splitNum, min, max, 0.85f);
}
public static List<Integer> genRandList(int total, int splitNum, int min, int max, float thresh) {
assert total >= splitNum * min && total <= splitNum * max;
assert thresh >= 0.0f && thresh <= 1.0f;
int average = total / splitNum;
List<Integer> list = new ArrayList<>(splitNum);
int rest = total - average * splitNum;
for (int i = 0; i < splitNum; i++) {
if (i < rest) {
list.add(average + 1);
} else {
list.add(average);
}
}
if (thresh == 0) {
return list;
}
for (int i = 0; i < splitNum - 1; i++) {
int nextIndex = i + 1;
int itemThis = list.get(i);
int itemNext = list.get(nextIndex);
boolean isLt = itemThis < itemNext;
int rangeThis = isLt ? max - itemThis : itemThis - min;
int rangeNext = isLt ? itemNext - min : max - itemNext;
int rangeFinal = (int) Math.ceil(thresh * (Math.min(rangeThis, rangeNext) + 1));
int randOfRange = random.nextInt(rangeFinal);
int randRom = isLt ? 1 : -1;
list.set(i, list.get(i) + randRom * randOfRange);
list.set(nextIndex, list.get(nextIndex) + randRom * randOfRange * -1);
}
return list;
}
public static void main(String[] args) {
System.out.println(genRandList(500, 20, 1, 200));
}
}
// 共10000随机分成300份,最小值为1,最大值为200。
genRandList(10000, 300, 1, 200, 0.95f)
![随机数分布图](https://i-blog.csdnimg.cn/blog_migrate/af6bbfde6a51363ae810d45dbc623d7d.png)
genRandList(10000, 300, 1, 200, 0.5f)
![随机数分布图](https://i-blog.csdnimg.cn/blog_migrate/e313352a4960562db539696c31afa945.png)