Java 桶排序实现 如何判断该放到哪个桶里

 public void bucketSort(int[] array) {
        int size = array.length;
        int max = array[0], min = array[0];
        for (int i = 1; i < size; i++) {
            if (array[i] > max) max = array[i];
            if (array[i] < min) min = array[i];

        }
        int bucketNum = size;//桶的数量
        ArrayList<LinkedList<Integer>> bucketList = new ArrayList<>();
        for (int i = 0; i < bucketNum; i++) {
            bucketList.add(new LinkedList<>());
        }
        for (int i = 0; i < size; i++) {
            //放到哪个桶
            int num = (array[i] - min) * (bucketNum - 1) / (max - min);//重点
            bucketList.get(num).add(array[i]);
        }
        for (int i=0;i<bucketNum;i++){
            Collections.sort(bucketList.get(i));
        }
        int index = 0;
        for (int i=0;i<bucketNum;i++){
            System.out.println("桶"+i+"的元素数量：" + bucketList.get(i).size());
            for (int n:bucketList.get(i)){
                array[index++] = n;
            }
        }
    }