将一个集合划分为 K 个等和的不相交子集

Question

给定 n ( n

Answer 1

一种改进蛮力方法的方法：

s = the sum of all the numbers
for i = 2 to 10
  k = s / i

  if k is an integer then
    Get all partitions of the input array with a minimum subset size of 2 elements and a maximum of n-1 elements.
    Check each partition as it's generated to see if all the subsets have the same sum.
    end if

  next i

硬（和慢）部分是生成分区。您可以使用递归函数来做到这一点。划分 20 个数字应该不会太慢。您可以通过尽早丢弃子集和不相等的分区来优化分区生成。