feat: add solutions to lc problem: No.2598

Author: yanglbme

solution/2500-2599/2598.Smallest Missing Non-negative Integer After Operations/README.md

@@ -167,6 +167,51 @@ function findSmallestInteger(nums: number[], value: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_smallest_integer(nums: Vec<i32>, value: i32) -> i32 {
+        let mut cnt = vec![0; value as usize];
+        for &x in &nums {
+            let idx = ((x % value + value) % value) as usize;
+            cnt[idx] += 1;
+        }
+
+        let mut i = 0;
+        loop {
+            let idx = (i % value) as usize;
+            if cnt[idx] == 0 {
+                return i;
+            }
+            cnt[idx] -= 1;
+            i += 1;
+        }
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} value
+ * @return {number}
+ */
+var findSmallestInteger = function (nums, value) {
+    const cnt = Array(value).fill(0);
+    for (const x of nums) {
+        ++cnt[((x % value) + value) % value];
+    }
+    for (let i = 0; ; ++i) {
+        if (cnt[i % value]-- === 0) {
+            return i;
+        }
+    }
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2500-2599/2598.Smallest Missing Non-negative Integer After Operations/README_EN.md

@@ -167,6 +167,51 @@ function findSmallestInteger(nums: number[], value: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_smallest_integer(nums: Vec<i32>, value: i32) -> i32 {
+        let mut cnt = vec![0; value as usize];
+        for &x in &nums {
+            let idx = ((x % value + value) % value) as usize;
+            cnt[idx] += 1;
+        }
+
+        let mut i = 0;
+        loop {
+            let idx = (i % value) as usize;
+            if cnt[idx] == 0 {
+                return i;
+            }
+            cnt[idx] -= 1;
+            i += 1;
+        }
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} value
+ * @return {number}
+ */
+var findSmallestInteger = function (nums, value) {
+    const cnt = Array(value).fill(0);
+    for (const x of nums) {
+        ++cnt[((x % value) + value) % value];
+    }
+    for (let i = 0; ; ++i) {
+        if (cnt[i % value]-- === 0) {
+            return i;
+        }
+    }
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2500-2599/2598.Smallest Missing Non-negative Integer After Operations/Solution.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @param {number} value
+ * @return {number}
+ */
+var findSmallestInteger = function (nums, value) {
+    const cnt = Array(value).fill(0);
+    for (const x of nums) {
+        ++cnt[((x % value) + value) % value];
+    }
+    for (let i = 0; ; ++i) {
+        if (cnt[i % value]-- === 0) {
+            return i;
+        }
+    }
+};

solution/2500-2599/2598.Smallest Missing Non-negative Integer After Operations/Solution.rs

@@ -0,0 +1,19 @@
+impl Solution {
+    pub fn find_smallest_integer(nums: Vec<i32>, value: i32) -> i32 {
+        let mut cnt = vec![0; value as usize];
+        for &x in &nums {
+            let idx = ((x % value + value) % value) as usize;
+            cnt[idx] += 1;
+        }
+
+        let mut i = 0;
+        loop {
+            let idx = (i % value) as usize;
+            if cnt[idx] == 0 {
+                return i;
+            }
+            cnt[idx] -= 1;
+            i += 1;
+        }
+    }
+}