feat: add solutions to lc problems: No.2917~2919

solution/2900-2999/2917.Find the K-or of an Array/README.md

@@ -150,6 +150,24 @@ function findKOr(nums: number[], k: number): number {
 }
 ```
 
+```cs
+public class Solution {
+    public int FindKOr(int[] nums, int k) {
+        int ans = 0;
+        for (int i = 0; i < 32; ++i) {
+            int cnt = 0;
+            foreach (int x in nums) {
+                cnt += (x >> i & 1);
+            }
+            if (cnt >= k) {
+                ans |= 1 << i;
+            }
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2900-2999/2917.Find the K-or of an Array/README_EN.md

@@ -147,6 +147,24 @@ function findKOr(nums: number[], k: number): number {
 }
 ```
 
+```cs
+public class Solution {
+    public int FindKOr(int[] nums, int k) {
+        int ans = 0;
+        for (int i = 0; i < 32; ++i) {
+            int cnt = 0;
+            foreach (int x in nums) {
+                cnt += (x >> i & 1);
+            }
+            if (cnt >= k) {
+                ans |= 1 << i;
+            }
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2900-2999/2917.Find the K-or of an Array/Solution.cs

@@ -0,0 +1,15 @@
+public class Solution {
+    public int FindKOr(int[] nums, int k) {
+        int ans = 0;
+        for (int i = 0; i < 32; ++i) {
+            int cnt = 0;
+            foreach (int x in nums) {
+                cnt += (x >> i & 1);
+            }
+            if (cnt >= k) {
+                ans |= 1 << i;
+            }
+        }
+        return ans;
+    }
+}

solution/2900-2999/2918.Minimum Equal Sum of Two Arrays After Replacing Zeros/README.md

@@ -165,6 +165,29 @@ function minSum(nums1: number[], nums2: number[]): number {
 }
 ```
 
+```cs
+public class Solution {
+    public long MinSum(int[] nums1, int[] nums2) {
+        long s1 = 0, s2 = 0;
+        bool hasZero = false;
+        foreach (int x in nums1) {
+            hasZero |= x == 0;
+            s1 += Math.Max(x, 1);
+        }
+        foreach (int x in nums2) {
+            s2 += Math.Max(x, 1);
+        }
+        if (s1 > s2) {
+            return MinSum(nums2, nums1);
+        }
+        if (s1 == s2) {
+            return s1;
+        }
+        return hasZero ? s2 : -1;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2900-2999/2918.Minimum Equal Sum of Two Arrays After Replacing Zeros/README_EN.md

@@ -161,6 +161,29 @@ function minSum(nums1: number[], nums2: number[]): number {
 }
 ```
 
+```cs
+public class Solution {
+    public long MinSum(int[] nums1, int[] nums2) {
+        long s1 = 0, s2 = 0;
+        bool hasZero = false;
+        foreach (int x in nums1) {
+            hasZero |= x == 0;
+            s1 += Math.Max(x, 1);
+        }
+        foreach (int x in nums2) {
+            s2 += Math.Max(x, 1);
+        }
+        if (s1 > s2) {
+            return MinSum(nums2, nums1);
+        }
+        if (s1 == s2) {
+            return s1;
+        }
+        return hasZero ? s2 : -1;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2900-2999/2918.Minimum Equal Sum of Two Arrays After Replacing Zeros/Solution.cs

@@ -0,0 +1,20 @@
+public class Solution {
+    public long MinSum(int[] nums1, int[] nums2) {
+        long s1 = 0, s2 = 0;
+        bool hasZero = false;
+        foreach (int x in nums1) {
+            hasZero |= x == 0;
+            s1 += Math.Max(x, 1);
+        }
+        foreach (int x in nums2) {
+            s2 += Math.Max(x, 1);
+        }
+        if (s1 > s2) {
+            return MinSum(nums2, nums1);
+        }
+        if (s1 == s2) {
+            return s1;
+        }
+        return hasZero ? s2 : -1;
+    }
+}

solution/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/README.md

@@ -155,6 +155,21 @@ function minIncrementOperations(nums: number[], k: number): number {
 }
 ```
 
+```cs
+public class Solution {
+    public long MinIncrementOperations(int[] nums, int k) {
+        long f = 0, g = 0, h = 0;
+        foreach (int x in nums) {
+            long hh = Math.Min(Math.Min(f, g), h) + Math.Max(k - x, 0);
+            f = g;
+            g = h;
+            h = hh;
+        }
+        return Math.Min(Math.Min(f, g), h);
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/README_EN.md

@@ -151,6 +151,21 @@ function minIncrementOperations(nums: number[], k: number): number {
 }
 ```
 
+```cs
+public class Solution {
+    public long MinIncrementOperations(int[] nums, int k) {
+        long f = 0, g = 0, h = 0;
+        foreach (int x in nums) {
+            long hh = Math.Min(Math.Min(f, g), h) + Math.Max(k - x, 0);
+            f = g;
+            g = h;
+            h = hh;
+        }
+        return Math.Min(Math.Min(f, g), h);
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/Solution.cs

@@ -0,0 +1,12 @@
+public class Solution {
+    public long MinIncrementOperations(int[] nums, int k) {
+        long f = 0, g = 0, h = 0;
+        foreach (int x in nums) {
+            long hh = Math.Min(Math.Min(f, g), h) + Math.Max(k - x, 0);
+            f = g;
+            g = h;
+            h = hh;
+        }
+        return Math.Min(Math.Min(f, g), h);
+    }
+}