擅长:python、mysql、java
<p>一个非常自然的公式是:</p>
<pre><code>from copy import copy
def recurse_find(decomposed,remaining,valid_numbers):
#base case
if remaining == 0:
return decomposed
#find all valid subtractions
else:
ans = []
for number in valid_numbers:
if remaining - number >= 0:
new_decomposed = copy(decomposed)
new_decomposed.append(number)
cand = recurse_find(new_decomposed,remaining-
number,valid_numbers)
if cand:
ans.append(cand)
if len(ans) > 0:
return ans
</code></pre>
<p>print(recurse_find([],5,[1,2,5])gt;匹配您请求的输出。在</p>