http://www.careercup.com/question?id=3190687
How do you partition an array into 2 parts such that the two parts have
equal average?...each partition may contain elements that are non-contiguous
in the array.
老看到这道题， 一直想不出比较简洁的解法。能想到的就是穷举所有的subset，计算
比较。
c****x 发帖数: 61
2
这是NPC，看着不像真的面试题
subset sum can be reduced to this problem
contiguous
【在 x****3 的大作中提到】 : http://www.careercup.com/question?id=3190687 : How do you partition an array into 2 parts such that the two parts have : equal average?...each partition may contain elements that are non-contiguous : in the array. : 老看到这道题， 一直想不出比较简洁的解法。能想到的就是穷举所有的subset，计算 : 比较。
