From 8399eed5204963a8968b7872cf4aa3c3ef486f8b Mon Sep 17 00:00:00 2001
From: Frogrey <35210929+Frogrey@users.noreply.github.com>
Date: Mon, 3 Jan 2022 17:13:00 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20674.=20=E6=9C=80=E9=95=BF?=
 =?UTF-8?q?=E8=BF=9E=E7=BB=AD=E9=80=92=E5=A2=9E=E5=BA=8F=E5=88=97=20Java?=
 =?UTF-8?q?=20=E8=B4=AA=E5=BF=83=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0674.最长连续递增序列.md | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
index 98e09bf8..51d04e92 100644
--- a/problems/0674.最长连续递增序列.md
+++ b/problems/0674.最长连续递增序列.md
@@ -154,6 +154,8 @@ public:
 
 
 Java：
+
+> 动态规划：
 ```java
  /**
      * 1.dp[i] 代表当前下标最大连续值
@@ -180,6 +182,25 @@ Java：
     }
 ```
 
+> 贪心法：
+
+```Java
+public static int findLengthOfLCIS(int[] nums) {
+    if (nums.length == 0) return 0;
+    int res = 1; // 连续子序列最少也是1
+    int count = 1;
+    for (int i = 0; i < nums.length - 1; i++) {
+        if (nums[i + 1] > nums[i]) { // 连续记录
+            count++;
+        } else { // 不连续，count从头开始
+            count = 1;
+        }
+        if (count > res) res = count;
+    }
+    return res;
+}
+```
+
 Python：
 
 > 动态规划：