"""Partition a set into two subsets such that the difference of subset sums is minimum"""def findMin(arr):n = len(arr)s = sum(arr)dp = [[False for x in range(s+1)]for y in range(n+1)]for i in range(1, n+1):dp[i][0] = Truefor i in range(1, s+1):dp[0][i] = Falsefor i in range(1, n+1):for j in range(1, s+1):dp[i][j]= dp[i][j-1]if (arr[i-1] <= j):dp[i][j] = dp[i][j] or dp[i-1][j-arr[i-1]]for j in range(int(s/2), -1, -1):if dp[n][j] == True:diff = s-2*jbreak;return diff
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。