You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A conveyor belt has packages that must be shipped from one port to another within D days.
8
8
9
-
The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than the maximum weight capacity of the ship.
9
+
The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than the maximum weight capacity of the ship.
10
10
11
11
Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within D days.
12
12
@@ -15,23 +15,23 @@ Return the least weight capacity of the ship that will result in all the package
15
15
```
16
16
Input: weights = [1,2,3,4,5,6,7,8,9,10], D = 5
17
17
Output: 15
18
-
Explanation:
18
+
Explanation:
19
19
A ship capacity of 15 is the minimum to ship all the packages in 5 days like this:
20
20
1st day: 1, 2, 3, 4, 5
21
21
2nd day: 6, 7
22
22
3rd day: 8
23
23
4th day: 9
24
24
5th day: 10
25
25
26
-
Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.
26
+
Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.
27
27
```
28
28
29
29
**Example 2:**
30
30
31
31
```
32
32
Input: weights = [3,2,2,4,1,4], D = 3
33
33
Output: 6
34
-
Explanation:
34
+
Explanation:
35
35
A ship capacity of 6 is the minimum to ship all the packages in 3 days like this:
36
36
1st day: 3, 2
37
37
2nd day: 2, 4
@@ -43,49 +43,42 @@ A ship capacity of 6 is the minimum to ship all the packages in 3 days like this
43
43
```
44
44
Input: weights = [1,2,3,1,1], D = 4
45
45
Output: 3
46
-
Explanation:
46
+
Explanation:
47
47
1st day: 1
48
48
2nd day: 2
49
49
3rd day: 3
50
50
4th day: 1, 1
51
51
```
52
52
53
-
54
-
55
-
**Note:**
53
+
**Note:**
56
54
57
55
1.`1 <= D <= weights.length <= 50000`
58
56
2.`1 <= weights[i] <= 500`
59
57
60
-
61
-
62
58
## Solution
63
59
64
-
The problem is same as [**LeetCode 875 koko-eating-bananas**](https://github.com/azl397985856/leetcode/blob/master/problems/875.koko-eating-bananas-en.md) practically.
60
+
The problem is same as [**LeetCode 875 koko-eating-bananas**](https://github.com/azl397985856/leetcode/blob/master/problems/875.koko-eating-bananas-en.md) practically.
65
61
66
-
It is easy to solve this kind of problems if you take a closer look into it.
62
+
It is easy to solve this kind of problems if you take a closer look into it.
67
63
68
-
69
-
The essence is to search a given number in finite discrete data like [ 1,2,3,4, ... , total ].
64
+
The essence is to search a given number in finite discrete data like [ 1,2,3,4, ... , total ].
70
65
71
66
However, We should find the cargo that can be shipped in D days rather than look for the target directly.
72
67
73
-
74
68
Consider the following questions:
75
69
76
70
- Can it be shipped if the capacity is 1?
77
71
- Can it be shipped if the capacity is 2?
78
72
- Can it be shipped if the capacity is 3?
79
73
- ...
80
-
- Can it be shipped if the capacity is total ? ( Yeap we can, D is greater than or equal to 1)
74
+
- Can it be shipped if the capacity is total ? ( Yeap we can, D is greater than or equal to 1)
81
75
82
-
During the process, we directly `return`if the answer is *yes*.
76
+
During the process, we directly `return` if the answer is _yes_.
83
77
84
-
If the answer is *no*, just keep asking.
78
+
If the answer is _no_, just keep asking.
85
79
86
80
This is a typical binary search problem, the only difference is the judgement condition:
87
81
88
-
89
82
```python
90
83
defcanShip(opacity):
91
84
# Whether the capacity of the specified ship can be shipped in D days
@@ -146,38 +139,38 @@ class Solution:
146
139
* @param{number}D
147
140
* @return{number}
148
141
*/
149
-
varshipWithinDays=function(weights, D) {
150
-
let high =weights.reduce((acc, cur) => acc + cur)
151
-
let low =0
142
+
varshipWithinDays=function(weights, D) {
143
+
let high =weights.reduce((acc, cur) => acc + cur);
0 commit comments