feat: add solutions to lc problems: No.2899~2901 (#1813)

* No.2899.Last Visited Integers
* No.2900.Longest Unequal Adjacent Groups Subsequence I
* No.2901.Longest Unequal Adjacent Groups Subsequence II

Author: yanglbme

solution/2800-2899/2899.Last Visited Integers/README.md

@@ -178,6 +178,31 @@ function lastVisitedIntegers(words: string[]): number[] {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn last_visited_integers(words: Vec<String>) -> Vec<i32> {
+        let mut nums: Vec<i32> = Vec::new();
+        let mut ans: Vec<i32> = Vec::new();
+        let mut k = 0;
+
+        for w in words {
+            if w == "prev" {
+                k += 1;
+                let i = nums.len() as i32 - k;
+                ans.push(if i < 0 { -1 } else { nums[i as usize] });
+            } else {
+                k = 0;
+                nums.push(w.parse::<i32>().unwrap());
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2800-2899/2899.Last Visited Integers/README_EN.md

@@ -168,6 +168,31 @@ function lastVisitedIntegers(words: string[]): number[] {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn last_visited_integers(words: Vec<String>) -> Vec<i32> {
+        let mut nums: Vec<i32> = Vec::new();
+        let mut ans: Vec<i32> = Vec::new();
+        let mut k = 0;
+
+        for w in words {
+            if w == "prev" {
+                k += 1;
+                let i = nums.len() as i32 - k;
+                ans.push(if i < 0 { -1 } else { nums[i as usize] });
+            } else {
+                k = 0;
+                nums.push(w.parse::<i32>().unwrap());
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2800-2899/2899.Last Visited Integers/Solution.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn last_visited_integers(words: Vec<String>) -> Vec<i32> {
+        let mut nums: Vec<i32> = Vec::new();
+        let mut ans: Vec<i32> = Vec::new();
+        let mut k = 0;
+
+        for w in words {
+            if w == "prev" {
+                k += 1;
+                let i = nums.len() as i32 - k;
+                ans.push(if i < 0 { -1 } else { nums[i as usize] });
+            } else {
+                k = 0;
+                nums.push(w.parse::<i32>().unwrap());
+            }
+        }
+
+        ans
+    }
+}

solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README.md

@@ -140,6 +140,24 @@ function getWordsInLongestSubsequence(n: number, words: string[], groups: number
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn get_words_in_longest_subsequence(n: i32, words: Vec<String>, groups: Vec<i32>) -> Vec<String> {
+        let mut ans = vec![];
+
+        for i in 0..n {
+            if i == 0 || groups[i as usize] != groups[(i - 1) as usize] {
+                ans.push(words[i as usize].clone());
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README_EN.md

@@ -131,6 +131,24 @@ function getWordsInLongestSubsequence(n: number, words: string[], groups: number
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn get_words_in_longest_subsequence(n: i32, words: Vec<String>, groups: Vec<i32>) -> Vec<String> {
+        let mut ans = vec![];
+
+        for i in 0..n {
+            if i == 0 || groups[i as usize] != groups[(i - 1) as usize] {
+                ans.push(words[i as usize].clone());
+            }
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn get_words_in_longest_subsequence(n: i32, words: Vec<String>, groups: Vec<i32>) -> Vec<String> {
+        let mut ans = vec![];
+
+        for i in 0..n {
+            if i == 0 || groups[i as usize] != groups[(i - 1) as usize] {
+                ans.push(words[i as usize].clone());
+            }
+        }
+
+        ans
+    }
+}