feat: update solutions to lc problem: No.1891

Author: yanglbme

solution/1800-1899/1891.Cutting Ribbons/README.md

@@ -70,7 +70,7 @@
 
 我们发现，如果我们能够得到长度为 $x$ 的 $k$ 根绳子，那么我们一定能够得到长度为 $x - 1$ 的 $k$ 根绳子，这存在着单调性。因此，我们可以使用二分查找的方法，找到最大的长度 $x$，使得我们能够得到长度为 $x$ 的 $k$ 根绳子。
 
-我们定义二分查找的左边界 $left=0$, $right=10^5$，中间值 $mid=(left+right+1)/2$，然后计算当前长度为 $mid$ 的绳子能够得到的数量 $cnt$，如果 $cnt \geq k$，说明我们能够得到长度为 $mid$ 的 $k$ 根绳子，那么我们将 $left$ 更新为 $mid$，否则我们将 $right$ 更新为 $mid-1$。
+我们定义二分查找的左边界 $left=0$, $right=\max(ribbons)$，中间值 $mid=(left+right+1)/2$，然后计算当前长度为 $mid$ 的绳子能够得到的数量 $cnt$，如果 $cnt \geq k$，说明我们能够得到长度为 $mid$ 的 $k$ 根绳子，那么我们将 $left$ 更新为 $mid$，否则我们将 $right$ 更新为 $mid-1$。
 
 最后，我们返回 $left$ 即可。
 
@@ -85,7 +85,7 @@
 ```python
 class Solution:
     def maxLength(self, ribbons: List[int], k: int) -> int:
-        left, right = 0, 100000
+        left, right = 0, max(ribbons)
         while left < right:
             mid = (left + right + 1) >> 1
             cnt = sum(x // mid for x in ribbons)
@@ -103,7 +103,10 @@ class Solution:
 ```java
 class Solution {
     public int maxLength(int[] ribbons, int k) {
-        int left = 0, right = 100000;
+        int left = 0, right = 0;
+        for (int x : ribbons) {
+            right = Math.max(right, x);
+        }
         while (left < right) {
             int mid = (left + right + 1) >>> 1;
             int cnt = 0;
@@ -127,7 +130,7 @@ class Solution {
 class Solution {
 public:
     int maxLength(vector<int>& ribbons, int k) {
-        int left = 0, right = 1e5;
+        int left = 0, right = *max_element(ribbons.begin(), ribbons.end());
         while (left < right) {
             int mid = (left + right + 1) >> 1;
             int cnt = 0;
@@ -149,7 +152,10 @@ public:
 
 ```go
 func maxLength(ribbons []int, k int) int {
-	left, right := 0, 100000
+	left, right := 0, 0
+	for _, x := range ribbons {
+		right = max(right, x)
+	}
 	for left < right {
 		mid := (left + right + 1) >> 1
 		cnt := 0
@@ -164,6 +170,13 @@ func maxLength(ribbons []int, k int) int {
 	}
 	return left
 }
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **JavaScript**
@@ -176,7 +189,7 @@ func maxLength(ribbons []int, k int) int {
  */
 var maxLength = function (ribbons, k) {
     let left = 0;
-    let right = 1e5;
+    let right = Math.max(...ribbons);
     while (left < right) {
         const mid = (left + right + 1) >> 1;
         let cnt = 0;
@@ -198,7 +211,7 @@ var maxLength = function (ribbons, k) {
 ```ts
 function maxLength(ribbons: number[], k: number): number {
     let left = 0;
-    let right = 1e5;
+    let right = Math.max(...ribbons);
     while (left < right) {
         const mid = (left + right + 1) >> 1;
         let cnt = 0;

solution/1800-1899/1891.Cutting Ribbons/README_EN.md

@@ -72,7 +72,7 @@ Now you have 4 ribbons of length 4.
 ```python
 class Solution:
     def maxLength(self, ribbons: List[int], k: int) -> int:
-        left, right = 0, 100000
+        left, right = 0, max(ribbons)
         while left < right:
             mid = (left + right + 1) >> 1
             cnt = sum(x // mid for x in ribbons)
@@ -88,7 +88,10 @@ class Solution:
 ```java
 class Solution {
     public int maxLength(int[] ribbons, int k) {
-        int left = 0, right = 100000;
+        int left = 0, right = 0;
+        for (int x : ribbons) {
+            right = Math.max(right, x);
+        }
         while (left < right) {
             int mid = (left + right + 1) >>> 1;
             int cnt = 0;
@@ -112,7 +115,7 @@ class Solution {
 class Solution {
 public:
     int maxLength(vector<int>& ribbons, int k) {
-        int left = 0, right = 1e5;
+        int left = 0, right = *max_element(ribbons.begin(), ribbons.end());
         while (left < right) {
             int mid = (left + right + 1) >> 1;
             int cnt = 0;
@@ -134,7 +137,10 @@ public:
 
 ```go
 func maxLength(ribbons []int, k int) int {
-	left, right := 0, 100000
+	left, right := 0, 0
+	for _, x := range ribbons {
+		right = max(right, x)
+	}
 	for left < right {
 		mid := (left + right + 1) >> 1
 		cnt := 0
@@ -149,6 +155,13 @@ func maxLength(ribbons []int, k int) int {
 	}
 	return left
 }
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **JavaScript**
@@ -161,7 +174,7 @@ func maxLength(ribbons []int, k int) int {
  */
 var maxLength = function (ribbons, k) {
     let left = 0;
-    let right = 1e5;
+    let right = Math.max(...ribbons);
     while (left < right) {
         const mid = (left + right + 1) >> 1;
         let cnt = 0;
@@ -183,7 +196,7 @@ var maxLength = function (ribbons, k) {
 ```ts
 function maxLength(ribbons: number[], k: number): number {
     let left = 0;
-    let right = 1e5;
+    let right = Math.max(...ribbons);
     while (left < right) {
         const mid = (left + right + 1) >> 1;
         let cnt = 0;

solution/1800-1899/1891.Cutting Ribbons/Solution.cpp

@@ -1,7 +1,7 @@
 class Solution {
 public:
     int maxLength(vector<int>& ribbons, int k) {
-        int left = 0, right = 1e5;
+        int left = 0, right = *max_element(ribbons.begin(), ribbons.end());
         while (left < right) {
             int mid = (left + right + 1) >> 1;
             int cnt = 0;

solution/1800-1899/1891.Cutting Ribbons/Solution.go

@@ -1,5 +1,8 @@
 func maxLength(ribbons []int, k int) int {
-	left, right := 0, 100000
+	left, right := 0, 0
+	for _, x := range ribbons {
+		right = max(right, x)
+	}
 	for left < right {
 		mid := (left + right + 1) >> 1
 		cnt := 0
@@ -13,4 +16,11 @@ func maxLength(ribbons []int, k int) int {
 		}
 	}
 	return left
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
 }

solution/1800-1899/1891.Cutting Ribbons/Solution.java

@@ -1,6 +1,9 @@
 class Solution {
     public int maxLength(int[] ribbons, int k) {
-        int left = 0, right = 100000;
+        int left = 0, right = 0;
+        for (int x : ribbons) {
+            right = Math.max(right, x);
+        }
         while (left < right) {
             int mid = (left + right + 1) >>> 1;
             int cnt = 0;

solution/1800-1899/1891.Cutting Ribbons/Solution.js

@@ -5,7 +5,7 @@
  */
 var maxLength = function (ribbons, k) {
     let left = 0;
-    let right = 1e5;
+    let right = Math.max(...ribbons);
     while (left < right) {
         const mid = (left + right + 1) >> 1;
         let cnt = 0;

solution/1800-1899/1891.Cutting Ribbons/Solution.py

@@ -1,11 +1,11 @@
 class Solution:
     def maxLength(self, ribbons: List[int], k: int) -> int:
-        left, right = 0, 100000
+        left, right = 0, max(ribbons)
         while left < right:
             mid = (left + right + 1) >> 1
             cnt = sum(x // mid for x in ribbons)
             if cnt >= k:
                 left = mid
             else:
                 right = mid - 1
-        return left
+        return left

solution/1800-1899/1891.Cutting Ribbons/Solution.ts

@@ -1,6 +1,6 @@
 function maxLength(ribbons: number[], k: number): number {
     let left = 0;
-    let right = 1e5;
+    let right = Math.max(...ribbons);
     while (left < right) {
         const mid = (left + right + 1) >> 1;
         let cnt = 0;