feat: add rust solution to lc problem: No.2670 (doocs#1098)

dierbei · web-flow · commit ee1f160e3122 · 2023-06-28T21:36:19.000+08:00
diff --git a/solution/2600-2699/2670.Find the Distinct Difference Array/README.md b/solution/2600-2699/2670.Find the Distinct Difference Array/README.md
@@ -182,6 +182,64 @@ function distinctDifferenceArray(nums: number[]): number[] {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_difference_array(nums: Vec<i32>) -> Vec<i32> {
+        let mut ans: Vec<i32> = Vec::new();
+
+        for i in 0..nums.len() {
+            let mut j = 0;
+            let mut hash1 = HashSet::new();
+            while j <= i {
+                hash1.insert(nums[j]);
+                j += 1;
+            }
+
+            let mut k = i + 1;
+            let mut hash2 = HashSet::new();
+            while k < nums.len() {
+                hash2.insert(nums[k]);
+                k += 1;
+            }
+
+            ans.push((hash1.len() - hash2.len()) as i32);
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_difference_array(nums: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let mut s = vec![0; n + 1];
+        let mut set = HashSet::new();
+
+        for i in (0..n).rev() {
+            set.insert(nums[i]);
+            s[i] = set.len();
+        }
+
+        let mut ans = Vec::new();
+        set.clear();
+        for i in 0..n {
+            set.insert(nums[i]);
+            ans.push((set.len() - s[i + 1]) as i32);
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/2600-2699/2670.Find the Distinct Difference Array/README_EN.md b/solution/2600-2699/2670.Find the Distinct Difference Array/README_EN.md
@@ -170,6 +170,64 @@ function distinctDifferenceArray(nums: number[]): number[] {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_difference_array(nums: Vec<i32>) -> Vec<i32> {
+        let mut ans: Vec<i32> = Vec::new();
+
+        for i in 0..nums.len() {
+            let mut j = 0;
+            let mut hash1 = HashSet::new();
+            while j <= i {
+                hash1.insert(nums[j]);
+                j += 1;
+            }
+
+            let mut k = i + 1;
+            let mut hash2 = HashSet::new();
+            while k < nums.len() {
+                hash2.insert(nums[k]);
+                k += 1;
+            }
+
+            ans.push((hash1.len() - hash2.len()) as i32);
+        }
+
+        ans
+    }
+}
+```
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_difference_array(nums: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let mut s = vec![0; n + 1];
+        let mut set = HashSet::new();
+
+        for i in (0..n).rev() {
+            set.insert(nums[i]);
+            s[i] = set.len();
+        }
+
+        let mut ans = Vec::new();
+        set.clear();
+        for i in 0..n {
+            set.insert(nums[i]);
+            ans.push((set.len() - s[i + 1]) as i32);
+        }
+
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/2600-2699/2670.Find the Distinct Difference Array/Solution.rs b/solution/2600-2699/2670.Find the Distinct Difference Array/Solution.rs
@@ -0,0 +1,23 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn distinct_difference_array(nums: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let mut s = vec![0; n + 1];
+        let mut set = HashSet::new();
+
+        for i in (0..n).rev() {
+            set.insert(nums[i]);
+            s[i] = set.len();
+        }
+
+        let mut ans = Vec::new();
+        set.clear();
+        for i in 0..n {
+            set.insert(nums[i]);
+            ans.push((set.len() - s[i + 1]) as i32);
+        }
+
+        ans
+    }
+}
