Golang.Leetcode416.PartitionEqualSubsetSum.go

dp
dp[i]:是否可以得到和i
dp[i&＃43;v]&＃61;true,如果dp[i]&＃61;&＃61;true&＃xff0c;如果可以得到i&＃xff0c;那么加上v就得到了i&＃43;v&＃xff0c;所以dp[i&＃43;v]&＃61;true
dp[0] &＃61;true,得到和0是可以的
循环处理获得dp&＃xff0c;期间要判断是否已经得到了结果

func canPartition(nums []int) bool {sum :&＃61; 0for _, v :&＃61; range nums {sum &＃43;&＃61; v}if sum%2 &＃61;&＃61; 1 {return false}dp :&＃61; make([]bool, sum&＃43;1)for k :&＃61; range dp {dp[k] &＃61; false}dp[0] &＃61; truefor _, v :&＃61; range nums {//注意&＃xff0c;这里是倒着循环&＃xff0c;避免被覆盖for i :&＃61; sum; i >&＃61; 0; i-- {if dp[i] {dp[i&＃43;v] &＃61; true}}if dp[sum/2] {return true}}return false
}

更多内容请移步我的repo&＃xff1a;https://github.com/anakin/golang-leetcode