feat: add csharp solution to lc problem: No.0875. Koko Eating Bananas

Author: yanglbme

solution/0800-0899/0875.Koko Eating Bananas/README.md

@@ -63,7 +63,7 @@
 ```python
 class Solution:
     def minEatingSpeed(self, piles: List[int], h: int) -> int:
-        left, right = 1, sum(piles)
+        left, right = 1, max(piles)
         while left < right:
             mid = (left + right) >> 1
             s = sum([(pile + mid - 1) // mid for pile in piles])
@@ -163,6 +163,34 @@ func max(a, b int) int {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MinEatingSpeed(int[] piles, int h) {
+        int left = 1, right = piles.Max();
+        while (left < right)
+        {
+            int mid = (left + right) >> 1;
+            int s = 0;
+            foreach (int pile in piles)
+            {
+                s += (pile + mid - 1) / mid;
+            }
+            if (s <= h)
+            {
+                right = mid;
+            }
+            else
+            {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0875.Koko Eating Bananas/README_EN.md

@@ -55,7 +55,7 @@ Binary search.
 ```python
 class Solution:
     def minEatingSpeed(self, piles: List[int], h: int) -> int:
-        left, right = 1, sum(piles)
+        left, right = 1, max(piles)
         while left < right:
             mid = (left + right) >> 1
             s = sum([(pile + mid - 1) // mid for pile in piles])
@@ -153,6 +153,34 @@ func max(a, b int) int {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MinEatingSpeed(int[] piles, int h) {
+        int left = 1, right = piles.Max();
+        while (left < right)
+        {
+            int mid = (left + right) >> 1;
+            int s = 0;
+            foreach (int pile in piles)
+            {
+                s += (pile + mid - 1) / mid;
+            }
+            if (s <= h)
+            {
+                right = mid;
+            }
+            else
+            {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0875.Koko Eating Bananas/Solution.cs

@@ -0,0 +1,23 @@
+public class Solution {
+    public int MinEatingSpeed(int[] piles, int h) {
+        int left = 1, right = piles.Max();
+        while (left < right)
+        {
+            int mid = (left + right) >> 1;
+            int s = 0;
+            foreach (int pile in piles)
+            {
+                s += (pile + mid - 1) / mid;
+            }
+            if (s <= h)
+            {
+                right = mid;
+            }
+            else
+            {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}

solution/0800-0899/0875.Koko Eating Bananas/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def minEatingSpeed(self, piles: List[int], h: int) -> int:
-        left, right = 1, sum(piles)
+        left, right = 1, max(piles)
         while left < right:
             mid = (left + right) >> 1
             s = sum([(pile + mid - 1) // mid for pile in piles])