From 826554682f465da29414c4ad6aa9ba391a54e05a Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Tue, 18 Jul 2023 16:51:54 +0800
Subject: [PATCH] =?UTF-8?q?Update=200674.=E6=9C=80=E9=95=BF=E8=BF=9E?=
 =?UTF-8?q?=E7=BB=AD=E9=80=92=E5=A2=9E=E5=BA=8F=E5=88=97.md=20about=20rust?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
index 8cc270ec..58365df3 100644
--- a/problems/0674.最长连续递增序列.md
+++ b/problems/0674.最长连续递增序列.md
@@ -303,6 +303,9 @@ func findLengthOfLCIS(nums []int) int {
 ```
 
 Rust:
+
+>动态规划
+
 ```rust
 pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
     if nums.is_empty() {
@@ -320,6 +323,25 @@ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
 }
 ```
 
+> 贪心
+
+```rust
+impl Solution {
+    pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
+        let (mut res, mut count) = (1, 1);
+        for i in 1..nums.len() {
+            if nums[i] > nums[i - 1] {
+                count += 1;
+                res = res.max(count);
+                continue;
+            }
+            count = 1;
+        }
+        res
+    }
+}
+```
+
 Javascript：
 
 > 动态规划：