Update 300. 最长递增子序列.md

Author: CompetitiveLin

Dynamic Programming/300. 最长递增子序列.md

@@ -92,3 +92,26 @@ class Solution {
 }
 ```
 
+
+
+Go 语言：
+
+```go
+func lengthOfLIS(nums []int) int {
+    dp := make([]int, len(nums))
+    dp[0] = 1
+    res := dp[0]
+    for i := 1; i < len(nums); i++ {
+        maxn := 0
+        for j := 0; j < i; j++ {
+            if nums[i] > nums[j] {
+                maxn = max(maxn, dp[j])
+            }
+        }
+        dp[i] = maxn + 1
+        res = max(res, dp[i])
+    }
+    return res
+}
+```
+