Merge pull request #701 from Aitensa/master

添加 0714.买卖股票的最佳时机含手续费（动态规划）.md Go版本 和 0968.监控二叉树 .md Go 版本

problems/0714.买卖股票的最佳时机含手续费（动态规划）.md

@@ -152,6 +152,25 @@ class Solution:
 ```
 
 Go：
+```Go
+func maxProfit(prices []int, fee int) int {
+    n := len(prices)
+    dp := make([][2]int, n)
+    dp[0][0] = -prices[0]
+    for i := 1; i < n; i++ {
+        dp[i][1] = max(dp[i-1][1], dp[i-1][0]+prices[i]-fee)
+        dp[i][0] = max(dp[i-1][0], dp[i-1][1]-prices[i])
+    }
+    return dp[n-1][1]
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
 
 Javascript：
 ```javascript

problems/0968.监控二叉树.md

@@ -368,7 +368,34 @@ class Solution:
         return result
 ```
 Go：
+```go
+const inf = math.MaxInt64 / 2
 
+func minCameraCover(root *TreeNode) int {
+    var dfs func(*TreeNode) (a, b, c int)
+    dfs = func(node *TreeNode) (a, b, c int) {
+        if node == nil {
+            return inf, 0, 0
+        }
+        lefta, leftb, leftc := dfs(node.Left)
+        righta, rightb, rightc := dfs(node.Right)
+        a = leftc + rightc + 1
+        b = min(a, min(lefta+rightb, righta+leftb))
+        c = min(a, leftb+rightb)
+        return
+    }
+    _, ans, _ := dfs(root)
+    return ans
+}
+
+func min(a, b int) int {
+    if a <= b {
+        return a
+    }
+    return b
+}
+
+```
 Javascript:
 ```Javascript
 var minCameraCover = function(root) {