commit solution 53

Author: lxlxw

index-tags.md

@@ -13,6 +13,7 @@
 |  [27](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/1-99/0027.remove-element/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [34](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array)  |  [在排序数组中查找元素的第一个和最后一个位置](/solution/1-99/0034.find-first-and-last-position-of-element-in-sorted-array/)  |  `数组`,`二分查找`  |  <font color=blue>中等</font>  |✅ |
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
+|  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |✅ |
 |  [66](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/1-99/0066.plus-one/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [75](https://leetcode-cn.com/problems/sort-colors)  |  [颜色分类](/solution/1-99/0075.sort-colors/)  |  `排序`,`数组`,`双指针`  |  <font color=blue>中等</font>  |✅ |
 |  [80](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii)  |  [删除排序数组中的重复项 ii](/solution/1-99/0080.remove-duplicates-from-sorted-array-ii/)  |  `数组`,`双指针`  |  <font color=blue>中等</font>  |✅ |
@@ -188,10 +189,15 @@
 
 #### **动态规划**
 
+|  题号  |  题解  |  标签  | 难度  | 是否解题 |
+| --- | --- | --- | --- | --- |
+|  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |✅ |
+
 #### **分治算法**
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
+|  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |✅ |
 |  [169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/100-199/0169.majority-element/)  |  `位运算`,`数组`,`分治算法`  |  <font color=green>简单</font>  |✅ |
 
 #### **回溯算法**

index-type.md

@@ -19,7 +19,7 @@
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [38](https://leetcode-cn.com/problems/count-and-say)  |  [外观数列](/solution/1-99/0038.count-and-say/)  |  `字符串`  |  <font color=green>简单</font>  |
-|  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |
+|  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |✅ |
 |  [58](https://leetcode-cn.com/problems/length-of-last-word)  |  [最后一个单词的长度](/solution/1-99/0058.length-of-last-word/)  |  `字符串`  |  <font color=green>简单</font>  |✅ |
 |  [66](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/1-99/0066.plus-one/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [67](https://leetcode-cn.com/problems/add-binary)  |  [二进制求和](/solution/1-99/0067.add-binary/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |

solution/1-99/0053.maximum-subarray/README.md

@@ -1,7 +1,7 @@
 # [53. 最大子序和](https://leetcode-cn.com/problems/maximum-subarray)
 
 ### 题目描述
-<!-- 这里写题目描述 -->
+
 <p>给定一个整数数组 <code>nums</code>&nbsp;，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。</p>
 
 <p><strong>示例:</strong></p>
@@ -22,12 +22,29 @@
 
 ### 具体解法
 
-<!-- tabs:start -->
+
 
 #### **Golang**
 ```go
-
+func maxSubArray(nums []int) int {
+	l := len(nums)
+	if l == 0 {
+		return 0
+	}
+	max := nums[l-1]
+	sum := nums[l-1]
+	for i := l - 2; i >= 0; i-- {
+		if sum > 0 {
+			sum += nums[i]
+		} else {
+			sum = nums[i]
+		}
+		if sum > max {
+			max = sum
+		}
+	}
+	return max
+}
 ```
 
-<!-- tabs:end -->
 

solution/1-99/0053.maximum-subarray/solution.go

@@ -0,0 +1,30 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=53 lang=golang
+ *
+ * [53] 最大子序和
+ */
+
+// @lc code=start
+func maxSubArray(nums []int) int {
+	l := len(nums)
+	if l == 0 {
+		return 0
+	}
+	max := nums[l-1]
+	sum := nums[l-1]
+	for i := l - 2; i >= 0; i-- {
+		if sum > 0 {
+			sum += nums[i]
+		} else {
+			sum = nums[i]
+		}
+		if sum > max {
+			max = sum
+		}
+	}
+	return max
+}
+
+// @lc code=end

solution/1-99/0053.maximum-subarray/solution_test.go

@@ -0,0 +1,22 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestMaxSubArray(t *testing.T) {
+	var nums []int
+	var ret int
+
+	ret = 10
+	nums = []int{1, 3, 6, -5, 4, -3, 2}
+	if ret != maxSubArray(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+
+	ret = 0
+	nums = []int{}
+	if ret != maxSubArray(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+}

solution/1-99/_sidebar.md

@@ -58,7 +58,7 @@
     - [50. pow(x, n) ✅](solution/1-99/0050.powx-c-n/)
     - [51. n皇后](solution/1-99/0051.n-queens/)
     - [52. n皇后 ii](solution/1-99/0052.n-queens-ii/)
-    - [53. 最大子序和](solution/1-99/0053.maximum-subarray/)
+    - [53. 最大子序和 ✅](solution/1-99/0053.maximum-subarray/)
     - [54. 螺旋矩阵](solution/1-99/0054.spiral-matrix/)
     - [55. 跳跃游戏](solution/1-99/0055.jump-game/)
     - [56. 合并区间](solution/1-99/0056.merge-intervals/)