feat: add solutions to lc problem: No.3354 (#4801)

Author: yanglbme

solution/3300-3399/3354.Make Array Elements Equal to Zero/README.md

@@ -216,6 +216,49 @@ function countValidSelections(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn count_valid_selections(nums: Vec<i32>) -> i32 {
+        let s: i32 = nums.iter().sum();
+        let mut ans = 0;
+        let mut l = 0;
+        for &x in &nums {
+            if x != 0 {
+                l += x;
+            } else if l * 2 == s {
+                ans += 2;
+            } else if (l * 2 - s).abs() <= 1 {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int CountValidSelections(int[] nums) {
+        int s = nums.Sum();
+        int ans = 0, l = 0;
+        foreach (int x in nums) {
+            if (x != 0) {
+                l += x;
+            } else if (l * 2 == s) {
+                ans += 2;
+            } else if (Math.Abs(l * 2 - s) <= 1) {
+                ans += 1;
+            }
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3354.Make Array Elements Equal to Zero/README_EN.md

@@ -214,6 +214,49 @@ function countValidSelections(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn count_valid_selections(nums: Vec<i32>) -> i32 {
+        let s: i32 = nums.iter().sum();
+        let mut ans = 0;
+        let mut l = 0;
+        for &x in &nums {
+            if x != 0 {
+                l += x;
+            } else if l * 2 == s {
+                ans += 2;
+            } else if (l * 2 - s).abs() <= 1 {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int CountValidSelections(int[] nums) {
+        int s = nums.Sum();
+        int ans = 0, l = 0;
+        foreach (int x in nums) {
+            if (x != 0) {
+                l += x;
+            } else if (l * 2 == s) {
+                ans += 2;
+            } else if (Math.Abs(l * 2 - s) <= 1) {
+                ans += 1;
+            }
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3300-3399/3354.Make Array Elements Equal to Zero/Solution.cs

@@ -0,0 +1,16 @@
+public class Solution {
+    public int CountValidSelections(int[] nums) {
+        int s = nums.Sum();
+        int ans = 0, l = 0;
+        foreach (int x in nums) {
+            if (x != 0) {
+                l += x;
+            } else if (l * 2 == s) {
+                ans += 2;
+            } else if (Math.Abs(l * 2 - s) <= 1) {
+                ans += 1;
+            }
+        }
+        return ans;
+    }
+}

solution/3300-3399/3354.Make Array Elements Equal to Zero/Solution.rs

@@ -0,0 +1,17 @@
+impl Solution {
+    pub fn count_valid_selections(nums: Vec<i32>) -> i32 {
+        let s: i32 = nums.iter().sum();
+        let mut ans = 0;
+        let mut l = 0;
+        for &x in &nums {
+            if x != 0 {
+                l += x;
+            } else if l * 2 == s {
+                ans += 2;
+            } else if (l * 2 - s).abs() <= 1 {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}