From 180d29afe10f13f333dfed665908b55a182ba495 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Tue, 18 Nov 2025 22:15:36 +0800 Subject: [PATCH] feat: add solutions to lc problem: No.3512 --- .../README.md | 20 +++++++++++++++++++ .../README_EN.md | 20 +++++++++++++++++++ .../Solution.cs | 5 +++++ .../Solution.rs | 5 +++++ 4 files changed, 50 insertions(+) create mode 100644 solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.cs create mode 100644 solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.rs diff --git a/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README.md b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README.md index 1eac9f1e34a59..3a02554b6efac 100644 --- a/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README.md +++ b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README.md @@ -145,6 +145,26 @@ function minOperations(nums: number[], k: number): number { } ``` +#### Rust + +```rust +impl Solution { + pub fn min_operations(nums: Vec, k: i32) -> i32 { + nums.iter().sum::() % k + } +} +``` + +#### C# + +```cs +public class Solution { + public int MinOperations(int[] nums, int k) { + return nums.Sum() % k; + } +} +``` + diff --git a/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README_EN.md b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README_EN.md index 7b36d3553191f..140dabc0b7459 100644 --- a/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README_EN.md +++ b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README_EN.md @@ -143,6 +143,26 @@ function minOperations(nums: number[], k: number): number { } ``` +#### Rust + +```rust +impl Solution { + pub fn min_operations(nums: Vec, k: i32) -> i32 { + nums.iter().sum::() % k + } +} +``` + +#### C# + +```cs +public class Solution { + public int MinOperations(int[] nums, int k) { + return nums.Sum() % k; + } +} +``` + diff --git a/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.cs b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.cs new file mode 100644 index 0000000000000..8207df66d8d07 --- /dev/null +++ b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.cs @@ -0,0 +1,5 @@ +public class Solution { + public int MinOperations(int[] nums, int k) { + return nums.Sum() % k; + } +} diff --git a/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.rs b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.rs new file mode 100644 index 0000000000000..633cfca2feff9 --- /dev/null +++ b/solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/Solution.rs @@ -0,0 +1,5 @@ +impl Solution { + pub fn min_operations(nums: Vec, k: i32) -> i32 { + nums.iter().sum::() % k + } +}