Merge branch 'youngyangyang04:master' into master

problems/0337.打家劫舍III.md

@@ -368,6 +368,41 @@ class Solution:
         return (val1, val2)
 ```
 
+Go:
+
+> 动态规划
+
+```go
+func rob(root *TreeNode) int {
+	res := robTree(root)
+	return max(res[0], res[1])
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func robTree(cur *TreeNode) []int {
+	if cur == nil {
+		return []int{0, 0}
+	}
+	// 后序遍历
+	left := robTree(cur.Left)
+	right := robTree(cur.Right)
+
+    // 考虑去偷当前的屋子
+	robCur := cur.Val + left[0] + right[0]
+    // 考虑不去偷当前的屋子
+	notRobCur := max(left[0], left[1]) + max(right[0], right[1])
+
+    // 注意顺序：0:不偷，1:去偷
+	return []int{notRobCur, robCur}
+}
+```
+
 JavaScript：
 
 > 动态规划

problems/0416.分割等和子集.md

@@ -226,6 +226,32 @@ class Solution:
         return taraget == dp[taraget]
 ```
 Go：
+```go
+// 分割等和子集 动态规划
+// 时间复杂度O(n^2) 空间复杂度O(n)
+func canPartition(nums []int) bool {
+    sum := 0
+    for _, num := range nums {
+        sum += num
+    }
+    // 如果 nums 的总和为奇数则不可能平分成两个子集
+    if sum % 2 == 1 {
+        return false
+    }
+    
+    target := sum / 2
+    dp := make([]int, target + 1)
+
+    for _, num := range nums {
+        for j := target; j >= num; j-- {
+            if dp[j] < dp[j - num] + num {
+                dp[j] = dp[j - num] + num
+            }
+        }
+    }
+    return dp[target] == target
+}
+```
 
 ```go
 func canPartition(nums []int) bool {

problems/剑指Offer58-II.左旋转字符串.md

@@ -200,17 +200,14 @@ func reverse(b []byte, left, right int){
 JavaScript：
 
 ```javascript
-var reverseLeftWords = function (s, n) {
-    const reverse = (str, left, right) => {
-        let strArr = str.split("");
-        for (; left < right; left++, right--) {
-            [strArr[left], strArr[right]] = [strArr[right], strArr[left]];
-        }
-        return strArr.join("");
-    }
-    s = reverse(s, 0, n - 1);
-    s = reverse(s, n, s.length - 1);
-    return reverse(s, 0, s.length - 1);
+var reverseLeftWords = function(s, n) {
+  const length = s.length;
+  let i = 0;
+  while (i < length - n) {
+    s = s[length - 1] + s;
+    i++;
+  }
+  return s.slice(0, length);
 };
 ```