Update 416. 分割等和子集.md

Author: CompetitiveLin

Dynamic Programming/416. 分割等和子集.md

@@ -60,4 +60,40 @@ class Solution {
         return dp[n - 1][target];
     }
 }
-```
+```
+
+
+
+Go 语言：
+
+```go
+func canPartition(nums []int) bool {
+    n, sum := len(nums), 0
+    for _, value := range(nums) {
+        sum += value
+    }
+    if sum % 2 != 0 || n == 1 {
+        return false
+    }
+    target := sum / 2
+    dp := make([][]bool, n)
+    for i := range dp {
+        dp[i] = make([]bool, target + 1)
+        dp[i][0] = true
+    }
+    if nums[0] <= target {
+        dp[0][nums[0]] = true
+    }
+    for i := 1; i < n; i++ {
+        for j := 1; j <= target; j++ {
+            if j > nums[i] {  
+                dp[i][j] = dp[i - 1][j] || dp[i - 1][j - nums[i]]
+            } else {
+                dp[i][j] = dp[i - 1][j]
+            }
+        }
+    }
+    return dp[n - 1][target]
+}
+```
+