From 1474a28a53ffe259d61aefcc822fa7e3e4959d44 Mon Sep 17 00:00:00 2001
From: yangzhaoMP <yz_ahha@163.com>
Date: Wed, 6 Mar 2024 14:59:28 +0800
Subject: [PATCH] =?UTF-8?q?=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92=20?=
 =?UTF-8?q?=E6=9C=80=E9=95=BF=E8=BF=9E=E7=BB=AD=E9=80=92=E5=A2=9E=E5=BA=8F?=
 =?UTF-8?q?=E5=88=97=20java=20=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92?=
 =?UTF-8?q?=E7=8A=B6=E6=80=81=E5=8E=8B=E7=BC=A9=E4=BC=98=E5=8C=96?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
index 485e321c..14a5e895 100644
--- a/problems/0674.最长连续递增序列.md
+++ b/problems/0674.最长连续递增序列.md
@@ -186,7 +186,23 @@ public:
         return res;
     }
 ```
-
+> 动态规划状态压缩
+```java
+class Solution {
+    public int findLengthOfLCIS(int[] nums) {
+        // 记录以 前一个元素结尾的最长连续递增序列的长度 和 以当前 结尾的......
+        int beforeOneMaxLen = 1, currentMaxLen = 0;
+        // res 赋最小值返回的最小值1
+        int res = 1;
+        for (int i = 1; i < nums.length; i ++) {
+            currentMaxLen = nums[i] > nums[i - 1] ? beforeOneMaxLen + 1 : 1;
+            beforeOneMaxLen = currentMaxLen;
+            res = Math.max(res, currentMaxLen);
+        }
+        return res;
+    }
+}
+```
 > 贪心法：
 
 ```Java