查找总和数的多少组合(代码中的变量n).例如:
3 = 1 + 1 + 1 = 2 + 1 = 3 => ANS为3 5 = 5 = 4 + 1 = 3 + 2 = 3 + 1 + 1 = 2 + 2 + 1 = 2 + 1 + 1 + 1 = 1 + 1 + 1 + 1 + 1 => ANS是7
3 = 1 + 1 + 1 = 2 + 1 = 3 => ANS为3
5 = 5 = 4 + 1 = 3 + 2 = 3 + 1 + 1 = 2 + 2 + 1 = 2 + 1 + 1 + 1 = 1 + 1 + 1 + 1 + 1 => ANS是7
在下面的例子中,m是最大数,n是sum,目的是找出它有多少(和)组合.
n
我只是想知道为什么p(n, m) = p(n, m - 1) + p(n - m, m)？ …
p(n, m) = p(n, m - 1) + p(n - m, m)
algorithm recursion integer-partition
algorithm ×1
integer-partition ×1
recursion ×1