feat: add solutions to lc problem: No.2604

No.2604.Minimum Time to Eat All Grains

Author: yanglbme

solution/2600-2699/2604.Minimum Time to Eat All Grains/README.md

@@ -270,6 +270,58 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minimumTime(hens: number[], grains: number[]): number {
+    hens.sort((a, b) => a - b);
+    grains.sort((a, b) => a - b);
+    const m = grains.length;
+    let l = 0;
+    let r = Math.abs(hens[0] - grains[0]) + grains[m - 1] - grains[0] + 1;
+
+    const check = (t: number): boolean => {
+        let j = 0;
+        for (const x of hens) {
+            if (j === m) {
+                return true;
+            }
+            const y = grains[j];
+            if (y <= x) {
+                const d = x - y;
+                if (d > t) {
+                    return false;
+                }
+                while (j < m && grains[j] <= x) {
+                    ++j;
+                }
+                while (
+                    j < m &&
+                    Math.min(d, grains[j] - x) + grains[j] - y <= t
+                ) {
+                    ++j;
+                }
+            } else {
+                while (j < m && grains[j] - x <= t) {
+                    ++j;
+                }
+            }
+        }
+        return j === m;
+    };
+
+    while (l < r) {
+        const mid = (l + r) >> 1;
+        if (check(mid)) {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
+    }
+    return l;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2604.Minimum Time to Eat All Grains/README_EN.md

@@ -249,6 +249,58 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minimumTime(hens: number[], grains: number[]): number {
+    hens.sort((a, b) => a - b);
+    grains.sort((a, b) => a - b);
+    const m = grains.length;
+    let l = 0;
+    let r = Math.abs(hens[0] - grains[0]) + grains[m - 1] - grains[0] + 1;
+
+    const check = (t: number): boolean => {
+        let j = 0;
+        for (const x of hens) {
+            if (j === m) {
+                return true;
+            }
+            const y = grains[j];
+            if (y <= x) {
+                const d = x - y;
+                if (d > t) {
+                    return false;
+                }
+                while (j < m && grains[j] <= x) {
+                    ++j;
+                }
+                while (
+                    j < m &&
+                    Math.min(d, grains[j] - x) + grains[j] - y <= t
+                ) {
+                    ++j;
+                }
+            } else {
+                while (j < m && grains[j] - x <= t) {
+                    ++j;
+                }
+            }
+        }
+        return j === m;
+    };
+
+    while (l < r) {
+        const mid = (l + r) >> 1;
+        if (check(mid)) {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
+    }
+    return l;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2604.Minimum Time to Eat All Grains/Solution.ts

@@ -0,0 +1,47 @@
+function minimumTime(hens: number[], grains: number[]): number {
+    hens.sort((a, b) => a - b);
+    grains.sort((a, b) => a - b);
+    const m = grains.length;
+    let l = 0;
+    let r = Math.abs(hens[0] - grains[0]) + grains[m - 1] - grains[0] + 1;
+
+    const check = (t: number): boolean => {
+        let j = 0;
+        for (const x of hens) {
+            if (j === m) {
+                return true;
+            }
+            const y = grains[j];
+            if (y <= x) {
+                const d = x - y;
+                if (d > t) {
+                    return false;
+                }
+                while (j < m && grains[j] <= x) {
+                    ++j;
+                }
+                while (
+                    j < m &&
+                    Math.min(d, grains[j] - x) + grains[j] - y <= t
+                ) {
+                    ++j;
+                }
+            } else {
+                while (j < m && grains[j] - x <= t) {
+                    ++j;
+                }
+            }
+        }
+        return j === m;
+    };
+
+    while (l < r) {
+        const mid = (l + r) >> 1;
+        if (check(mid)) {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
+    }
+    return l;
+}