import java.security.SecureRandom; //导入方法依赖的package包/类
public static List weightedSamplingWithReplacement(List values,
List weights, int numberOfSamples) {
int minIndex, maxIndex, sampleIndex;
int size = values.size();
// Calculating the next power of two
int power = (int) Math.ceil(Math.log((double) size) / Math.log(2));
int numPartitions = (int) Math.pow(2, power);
double minValue, maxValue, remainingCapacity, sample, w, elementWeight;
double capacity = 1.00 / numPartitions;
List partition, samplePartition;
SecureRandom random = new SecureRandom();
List> listPartitions = new ArrayList<>(numPartitions);
for (int i = 0; i < numPartitions; i++) {
partition = new ArrayList();
minValue = Collections.min(weights);
minIndex = weights.indexOf(minValue);
partition.add((double) minIndex);
if (minValue >= capacity) {
weights.set(minIndex, (minValue - capacity));
partition.add(-1.00);
partition.add(1.00);
} else {
remainingCapacity = capacity - minValue;
maxValue = Collections.max(weights);
maxIndex = weights.indexOf(maxValue);
partition.add((double) maxIndex);
partition.add(minValue / capacity);
weights.set(minIndex, 0.0);
weights.set(maxIndex, (maxValue - remainingCapacity));
}
listPartitions.add(partition);
}
List samples = new ArrayList<>();
for (int i = 0; i < numberOfSamples; i++) {
sample = random.nextDouble() * numPartitions;
sampleIndex = (int) sample;
w = sample - sampleIndex;
samplePartition = listPartitions.get(sampleIndex);
elementWeight = samplePartition.get(2);
if (w <= elementWeight) {
samples.add(values.get(samplePartition.get(0).intValue()));
} else {
samples.add(values.get(samplePartition.get(1).intValue()));
}
}
return samples;
}