From 2c7ea5a9f595acbebf03ba656d72ecc2b65d6a88 Mon Sep 17 00:00:00 2001
From: jiangjiang <366649270@qq.com>
Date: Thu, 29 Jul 2021 00:46:31 +0800
Subject: [PATCH] =?UTF-8?q?Update=200053.=E6=9C=80=E5=A4=A7=E5=AD=90?=
 =?UTF-8?q?=E5=BA=8F=E5=92=8C=EF=BC=88=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92?=
 =?UTF-8?q?=EF=BC=89.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

add solution of golang for  0053.最大子序和
---
 .../0053.最大子序和（动态规划）.md | 28 +++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0053.最大子序和（动态规划）.md b/problems/0053.最大子序和（动态规划）.md
index dd0e513b..ada378b2 100644
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@@ -138,7 +138,35 @@ class Solution:
 ```
 
 Go：
+```Go
+// solution
+// 1, dp
+// 2, 贪心
 
+func maxSubArray(nums []int) int {
+    n := len(nums)
+    // 这里的dp[i] 表示，最大的连续子数组和，包含num[i] 元素
+    dp := make([]int,n)
+    // 初始化，由于dp 状态转移方程依赖dp[0]
+    dp[0] = nums[0]
+    // 初始化最大的和
+    mx := nums[0]
+    for i:=1;i<n;i++ {
+        // 这里的状态转移方程就是：求最大和
+        // 会面临2种情况，一个是带前面的和，一个是不带前面的和
+        dp[i] = max(dp[i-1]+nums[i],nums[i])
+        mx = max(mx,dp[i])
+    }
+    return mx
+}
+
+func max(a,b int) int{
+    if a>b {
+        return a 
+    }
+    return b
+}
+```