0674.最长连续递增序列-go动态规划求解

problems/0674.最长连续递增序列.md

@@ -236,6 +236,45 @@ class Solution:
 ```
 
 Go：
+> 动态规划：
+```go
+func findLengthOfLCIS(nums []int) int {
+	if len(nums) == 0 {return 0}
+	res, count := 1, 1
+	for i := 0; i < len(nums)-1; i++ {
+		if nums[i+1] > nums[i] {
+			count++
+		}else {
+			count = 1
+		}
+		if count > res {
+			res = count
+		}
+	}
+	return res
+}
+```
+
+> 贪心算法：
+```go
+func findLengthOfLCIS(nums []int) int {
+	if len(nums) == 0 {return 0}
+	dp := make([]int, len(nums))
+	for i := 0; i < len(dp); i++ {
+		dp[i] = 1
+	}
+	res := 1
+	for i := 0; i < len(nums)-1; i++ {
+		if nums[i+1] > nums[i] {
+			dp[i+1] = dp[i] + 1
+		}
+		if dp[i+1] > res {
+			res = dp[i+1]
+		}
+	}
+	return res
+}
+```
 
 Javascript：