filling-bookcase-shelves

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array <code>books</code> where <code>books[i] = [thicknessi, heighti]</code> indicates the thickness and height of the <code>ith</code> book. You are also given an integer <code>shelfWidth</code>.

We want to place these books in order onto bookcase shelves that have a total width <code>shelfWidth</code>.

We choose some of the books to place on this shelf such that the sum of their thickness is less than or equal to <code>shelfWidth</code>, then build another level of the shelf of the bookcase so that the total height of the bookcase has increased by the maximum height of the books we just put down. We repeat this process until there are no more books to place.

Note that at each step of the above process, the order of the books we place is the same order as the given sequence of books.

<ul>
	<li>For example, if we have an ordered list of <code>5</code> books, we might place the first and second book onto the first shelf, the third book on the second shelf, and the fourth and fifth book on the last shelf.</li>
</ul>

Return the minimum possible height that the total bookshelf can be after placing shelves in this manner.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/24/shelves.png" style="height: 500px; width: 337px;" />
<pre>
Input: books = [[1,1],[2,3],[2,3],[1,1],[1,1],[1,1],[1,2]], shelfWidth = 4
Output: 6
Explanation:
The sum of the heights of the 3 shelves is 1 + 3 + 2 = 6.
Notice that book number 2 does not have to be on the first shelf.
</pre>

Example 2:

<pre>
Input: books = [[1,3],[2,4],[3,2]], shelfWidth = 6
Output: 4
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= books.length &lt;= 1000</code></li>
	<li><code>1 &lt;= thicknessi &lt;= shelfWidth &lt;= 1000</code></li>
	<li><code>1 &lt;= heighti &lt;= 1000</code></li>
</ul>

minHeightShelves

Filling Bookcase Shelves

Array

Dynamic Programming

给定一个数组 <code>books</code> ，其中&nbsp;<code>books[i] = [thicknessi, heighti]</code>&nbsp;表示第 <code>i</code> 本书的厚度和高度。你也会得到一个整数 <code>shelfWidth</code> 。

按顺序&nbsp;将这些书摆放到总宽度为 <code>shelfWidth</code> 的书架上。

先选几本书放在书架上（它们的厚度之和小于等于书架的宽度 <code>shelfWidth</code> ），然后再建一层书架。重复这个过程，直到把所有的书都放在书架上。

需要注意的是，在上述过程的每个步骤中，摆放书的顺序与给定图书数组 <code>books</code> 顺序相同。

<ul>
	<li>例如，如果这里有 5 本书，那么可能的一种摆放情况是：第一和第二本书放在第一层书架上，第三本书放在第二层书架上，第四和第五本书放在最后一层书架上。</li>
</ul>

每一层所摆放的书的最大高度就是这一层书架的层高，书架整体的高度为各层高之和。

以这种方式布置书架，返回书架整体可能的最小高度。

&nbsp;

示例 1：

<img src="https://assets.leetcode.com/uploads/2019/06/24/shelves.png" style="width: 337px; height: 500px;" />

<pre>
输入：books = [[1,1],[2,3],[2,3],[1,1],[1,1],[1,1],[1,2]], shelfWidth = 4
输出：6
解释：
3 层书架的高度和为 1 + 3 + 2 = 6 。
第 2 本书不必放在第一层书架上。
</pre>

示例 2:

<pre>
输入: books = [[1,3],[2,4],[3,2]], shelfWidth = 6
输出: 4
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= books.length &lt;= 1000</code></li>
	<li><code>1 &lt;= thicknessi&nbsp;&lt;= shelfWidth &lt;= 1000</code></li>
	<li><code>1 &lt;= heighti&nbsp;&lt;= 1000</code></li>
</ul>