From 2a247394a3b1cfc8a5bf03c291e92f72e32e3e35 Mon Sep 17 00:00:00 2001
From: Qi Jia <13632059+jackeyjia@users.noreply.github.com>
Date: Tue, 13 Jul 2021 19:23:18 -0700
Subject: [PATCH] add js solution for findLengthOfLCIS

---
 ...22\345\242\236\345\272\217\345\210\227.md" | 43 +++++++++++++++++++
 1 file changed, 43 insertions(+)

diff --git "a/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md" "b/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md"
index 31ab6b0eb4..614bff7274 100644
--- "a/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md"
+++ "b/problems/0674.\346\234\200\351\225\277\350\277\236\347\273\255\351\200\222\345\242\236\345\272\217\345\210\227.md"
@@ -218,6 +218,49 @@ class Solution:
 
 Go：
 
+Javascript：
+
+> 动态规划：
+```javascript
+const findLengthOfLCIS = (nums) => {
+    let dp = Array(nums.length).fill(1);
+
+
+    for(let i = 0; i < nums.length - 1; i++) {
+        if(nums[i+1] > nums[i]) {
+            dp[i+1] = dp[i]+ 1;
+        }
+    }
+
+    return Math.max(...dp);
+};
+```
+
+> 贪心法：
+```javascript
+const findLengthOfLCIS = (nums) => {
+    if(nums.length === 1) {
+        return 1;
+    }
+
+    let maxLen = 1;
+    let curMax = 1;
+    let cur = nums[0];
+
+    for(let num of nums) {
+        if(num > cur) {
+            curMax += 1;
+            maxLen =  Math.max(maxLen, curMax);
+        } else {
+            curMax = 1;
+        }
+        cur = num;
+    }
+
+    return maxLen;
+};
+```
+