MJ的博客

public static void main(String[] args) { int[] arr = new int[]{4, 43, 3, 7, 23, 34, 34}; Arrays.sort(arr);//先排序:3 4 7 23 34 34 43 int expect = 111; int maxDeep = arr.length; int[] suggest = getSuggest(arr, e...

1.填充法（先每个包1分保底，避免空红包，剩余的钱随机分给随机的红包直到分完） 缺点： public static void main(String[] args) { for (int i = 0; i < 10; i++) { int[] hongBaos = createHongBaos(100, 10); for (int hongBao : hongBaos) { System.ou.