我简直服了今日头条
在本地测试的题目，都没问题，就是显示测试用例通过为0（只有第三题正常）.以第二题为例
显然就是找出给定的数组的所有组合形式，然后计算min(sub_arr) * sum(sub_arr)。
#coding = utf-8
import sys
length = int(sys.stdin.readline().strip())
line = sys.stdin.readline().strip()
nums = map(int, line.split())
class composition(object):
def dfs(self, nums, index, path, res):
if len(path) != 0:
res.append(path)
for i in range(index, len(nums)):
self.dfs(nums, i+1, path+[nums[i]], res)
def subset(self, nums):
res = []
self.dfs(nums, 0, [], res)
return res
lst = composition().subset(nums)
maxs = -pow(2, 31)
for i in lst:
if min(i) * sum(i) > maxs:
maxs = min(i) * sum(i)
print maxs
然而就是0通过，再加上后面的系统设计题完全不懂，GG了···
