feat: update solution to lc problem: No.3394 (#4335)

Author: yanglbme

solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/README.md

@@ -122,10 +122,9 @@ class Solution {
     public int minimumOperations(int[] nums) {
         Set<Integer> s = new HashSet<>();
         for (int i = nums.length - 1; i >= 0; --i) {
-            if (s.contains(nums[i])) {
+            if (!s.add(nums[i])) {
                 return i / 3 + 1;
             }
-            s.add(nums[i]);
         }
         return 0;
     }
@@ -180,6 +179,24 @@ function minimumOperations(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
+        let mut s = HashSet::new();
+        for i in (0..nums.len()).rev() {
+            if !s.insert(nums[i]) {
+                return (i / 3) as i32 + 1;
+            }
+        }
+        0
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/README_EN.md

@@ -118,10 +118,9 @@ class Solution {
     public int minimumOperations(int[] nums) {
         Set<Integer> s = new HashSet<>();
         for (int i = nums.length - 1; i >= 0; --i) {
-            if (s.contains(nums[i])) {
+            if (!s.add(nums[i])) {
                 return i / 3 + 1;
             }
-            s.add(nums[i]);
         }
         return 0;
     }
@@ -176,6 +175,24 @@ function minimumOperations(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
+        let mut s = HashSet::new();
+        for i in (0..nums.len()).rev() {
+            if !s.insert(nums[i]) {
+                return (i / 3) as i32 + 1;
+            }
+        }
+        0
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/Solution.java

@@ -2,10 +2,9 @@ class Solution {
     public int minimumOperations(int[] nums) {
         Set<Integer> s = new HashSet<>();
         for (int i = nums.length - 1; i >= 0; --i) {
-            if (s.contains(nums[i])) {
+            if (!s.add(nums[i])) {
                 return i / 3 + 1;
             }
-            s.add(nums[i]);
         }
         return 0;
     }

solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/Solution.rs

@@ -0,0 +1,13 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
+        let mut s = HashSet::new();
+        for i in (0..nums.len()).rev() {
+            if !s.insert(nums[i]) {
+                return (i / 3) as i32 + 1;
+            }
+        }
+        0
+    }
+}