存量题库数据更新

leetcode/problem/delivering-boxes-from-storage-to-ports.html

@@ -21,7 +21,7 @@
 <p>Return <em>the <strong>minimum</strong> number of <strong>trips</strong> the ship needs to make to deliver all boxes to their respective ports.</em></p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> boxes = [[1,1],[2,1],[1,1]], portsCount = 2, maxBoxes = 3, maxWeight = 3
@@ -32,7 +32,7 @@ So the total number of trips is 4.
 Note that the first and third boxes cannot be delivered together because the boxes need to be delivered in order (i.e. the second box needs to be delivered at port 2 before the third box).
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> boxes = [[1,2],[3,3],[3,1],[3,1],[2,4]], portsCount = 3, maxBoxes = 3, maxWeight = 6
@@ -40,11 +40,11 @@ Note that the first and third boxes cannot be delivered together because the box
 <strong>Explanation:</strong> The optimal strategy is as follows: 
 - The ship takes the first box, goes to port 1, then returns to storage. 2 trips.
 - The ship takes the second, third and fourth boxes, goes to port 3, then returns to storage. 2 trips.
-- The ship takes the fifth box, goes to port 3, then returns to storage. 2 trips.
+- The ship takes the fifth box, goes to port 2, then returns to storage. 2 trips.
 So the total number of trips is 2 + 2 + 2 = 6.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> boxes = [[1,4],[1,2],[2,1],[2,1],[3,2],[3,4]], portsCount = 3, maxBoxes = 6, maxWeight = 7