流量均衡算法,任意一个整数等分任意份数

cuilll

已于 2022-05-05 21:25:53 修改

阅读量285

点赞数

于 2022-05-05 20:33:13 首次发布

本文链接：https://blog.csdn.net/cui_song_lin/article/details/124596959

版权

权重分配算法优化资源均衡编程数据结构

关键词由CSDN通过智能技术生成

    public static List<Integer> genWeightList(int totalWeight, int typeNum) {
        ArrayList<Integer> list = new ArrayList<>();
        int remainder = totalWeight % typeNum;
        int avgWeight = totalWeight / typeNum;
        for (int i = 0; i < typeNum; i++) {
            list.add(avgWeight);
        }
        for (int i = 0; i < typeNum && remainder > 0; i++) {
            Integer integer = list.get(i);
            list.set(i, integer + 1);
            remainder--;
        }

        return list;
    }

先均分再挨个匀

改进一下

  public static List<Integer> genWeightList(int totalWeight, int azCount) {
        ArrayList<Integer> list = new ArrayList<>();
        int remainder = totalWeight % azCount;
        int avgWeight = totalWeight / azCount;
        for (int i = 0; i < azCount; i++) {
            if (remainder>0){
                list.add(avgWeight+1);
                remainder--;
            }else {
                list.add(avgWeight);
            }

        }

        return list;
    }