规范格式

leetcode/0416.Partition-Equal-Subset-Sum/416. Partition Equal Subset Sum.go

@@ -0,0 +1,22 @@
+package leetcode
+
+func canPartition(nums []int) bool {
+	sum := 0
+	for _, v := range nums {
+		sum += v
+	}
+	if sum%2 != 0 {
+		return false
+	}
+	// C = half sum
+	n, C, dp := len(nums), sum/2, make([]bool, sum/2+1)
+	for i := 0; i <= C; i++ {
+		dp[i] = (nums[0] == i)
+	}
+	for i := 1; i < n; i++ {
+		for j := C; j >= nums[i]; j-- {
+			dp[j] = dp[j] || dp[j-nums[i]]
+		}
+	}
+	return dp[C]
+}