feat: add rust solution to lc problem: No.0674 (doocs#1262)

Author: xzhseh

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README.md

@@ -131,6 +131,32 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        // Here dp[i] represents the longest lcis that ends with `nums[i]`, should be 1 by default
+        let mut dp: Vec<i32> = vec![1; n];
+        let mut ret = dp[0];
+
+        // Let's dp
+        for i in 1..n {
+            dp[i] = if nums[i] > nums[i - 1] {
+                dp[i - 1] + 1
+            } else {
+                1
+            };
+            ret = std::cmp::max(ret, dp[i]);
+        }
+
+        ret
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README_EN.md

@@ -115,6 +115,32 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        // Here dp[i] represents the longest lcis that ends with `nums[i]`, should be 1 by default
+        let mut dp: Vec<i32> = vec![1; n];
+        let mut ret = dp[0];
+
+        // Let's dp
+        for i in 1..n {
+            dp[i] = if nums[i] > nums[i - 1] {
+                dp[i - 1] + 1
+            } else {
+                1
+            };
+            ret = std::cmp::max(ret, dp[i]);
+        }
+
+        ret
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.rs

@@ -0,0 +1,21 @@
+impl Solution {
+    #[allow(dead_code)]
+    pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        // Here dp[i] represents the longest lcis that ends with `nums[i]`, should be 1 by default
+        let mut dp: Vec<i32> = vec![1; n];
+        let mut ret = dp[0];
+
+        // Let's dp
+        for i in 1..n {
+            dp[i] = if nums[i] > nums[i - 1] {
+                dp[i - 1] + 1
+            } else {
+                1
+            };
+            ret = std::cmp::max(ret, dp[i]);
+        }
+
+        ret
+    }
+}