如何从一个随机数中找到一个组合array具有重复元素且其总和相等n.
Example
-
array is [1, 2, 2, 3] and n is 3
- 答案是
1+2, 1+2, 3
- If
randomSubsetSum(array, n)是解，那么randomSubsetSum([1,2,2,3], 3)将返回其中之一1+2, 1+2, 3. Note: 1+2出现频率是3
- 真实场景：从题库中随机选择问题进行考试
我发现了一些类似的问题和解决方案：
-
Q: 找出所有可能的数字组合以达到给定的总和
A: 溶液A and 溶液B
-
Q: 具有 k 个部分的排序和非排序整数分区
A: 溶液C
Defect
solution A and solution B不能随机找到组合。solution C不允许重复元素。
我的Java解决方案
public List<Integer> randomSubsetSum(List<Integer> list, Integer n) {
list.removeIf(e -> e > n);
int maxSum = list.stream().reduce(0, Integer::sum);
if (maxSum < n) {
throw new RuntimeException("maxSum of list lower than n!");
}
if (maxSum == n) {
return list;
}
final SecureRandom random = new SecureRandom();
// maybe helpful, not important
final Map<Integer, List<Integer>> map = list.stream().collect(Collectors.groupingBy(Function.identity()));
final List<Integer> keys = new ArrayList<>(map.keySet());
final List<Integer> answers = new ArrayList<>();
int sum = 0;
while (true) {
int keyIndex = random.nextInt(keys.size());
Integer key = keys.get(keyIndex);
sum += key;
// sum equal n
if (sum == n) {
List<Integer> elements = map.get(key);
answers.add(elements.get(random.nextInt(elements.size())));
break;
}
// sum below n
if (sum < n) {
List<Integer> elements = map.get(key);
answers.add(elements.remove(random.nextInt(elements.size())));
if (elements.isEmpty()) {
map.remove(key);
keys.remove(keyIndex);
}
continue;
}
// sum over n: exists (below = n - sum + key) in keys
int below = n - sum + key;
if (CollectionUtils.isNotEmpty(map.get(below))) {
List<Integer> elements = map.get(below);
answers.add(elements.get(random.nextInt(elements.size())));
break;
}
// sum over n: exists (over = sum - n) in answers
int over = sum - n;
int answerIndex =
IntStream.range(0, answers.size())
.filter(index -> answers.get(index) == over)
.findFirst().orElse(-1);
if (answerIndex != -1) {
List<Integer> elements = map.get(key);
answers.set(answerIndex, elements.get(random.nextInt(elements.size())));
break;
}
// Point A. BUG: may occur infinite loop
// sum over n: rollback sum
sum -= key;
// sum over n: remove min element in answer
Integer minIndex =
IntStream.range(0, answers.size())
.boxed()
.min(Comparator.comparing(answers::get))
// never occurred
.orElseThrow(RuntimeException::new);
Integer element = answers.remove((int) minIndex);
sum -= element;
if (keys.contains(element)) {
map.get(element).add(element);
} else {
keys.add(element);
map.put(element, new ArrayList<>(Collections.singleton(element)));
}
}
return answers;
}
At Point A，可能会出现无限循环（例如randomSubsetSum([3,4,8],13)）或花费大量时间。如何修复这个bug或者有其他解决方案吗？
这是根据解决方案 A 稍加修改的解决方案。
from random import random
def random_subset_sum(array, target):
sign = 1
array = sorted(array)
if target < 0:
array = reversed(array)
sign = -1
# Checkpoint A
last_index = {0: [[-1,1]]}
for i in range(len(array)):
for s in list(last_index.keys()):
new_s = s + array[i]
total = 0
for index, count in last_index[s]:
total += count
if 0 < (new_s - target) * sign:
pass # Cannot lead to target
elif new_s in last_index:
last_index[new_s].append([i,total])
else:
last_index[new_s] = [[i, total]]
# Checkpoint B
answer_indexes = []
last_choice = len(array)
while -1 < last_choice:
choice = None
total = 0
for i, count in last_index[target]:
if last_choice <= i:
break
total += count
if random() <= count / total:
choice = i
target -= array[choice]
last_choice = choice
if -1 < choice:
answer_indexes.append(choice)
return [array[i] for i in reversed(answer_indexes)]
本文内容由网友自发贡献，版权归原作者所有，本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容，请联系:hwhale#tublm.com(使用前将#替换为@)
