leetcode -- 1105. Filling Bookcase Shelves

We have a sequence of books: the i-th book has thickness books[i][0] and height books[i][1].

We want to place these books in order onto bookcase shelves that have total width shelf_width.

We choose some of the books to place on this shelf (such that the sum of their thickness is <= shelf_width), then build another level of 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 again 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.  For example, if we have an ordered list of 5 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.

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

 

Example 1:

Input: books = [[1,1],[2,3],[2,3],[1,1],[1,1],[1,1],[1,2]], shelf_width = 4
Output: 6
Explanation:
The sum of the heights of the 3 shelves are 1 + 3 + 2 = 6.
Notice that book number 2 does not have to be on the first shelf.

 

Constraints:

    1 <= books.length <= 1000
    1 <= books[i][0] <= shelf_width <= 1000
    1 <= books[i][1] <= 1000

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/filling-bookcase-shelves
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

思路：

1、dp[i]表示第i本书放入书架时的书架的最小高度

2、边界：dp[0] = 0，前0本书当然是0

3、遍历每一本书，把当前这本书作为书架最后一层的最后一本书，将这本书之前的书向后调整，看看是否可以减少之前的书架高度。dp[i] = min(dp[i], dp[j-1] + h) ， h是最后一层最大高度，j是最后一层所能容纳书籍的索引

class Solution {
public:
    int minHeightShelves(vector<vector<int>>& books, int shelf_width) {
        int n = books.size();
        if(n < 1) return 0;
        vector<int> dp(n+1,INT_MAX); //前i本书的最小高度
        dp[0] = 0;
        for(int i = 1; i <= n; i++){  //从第一本开始
            int tmp_width = 0, h = 0;
            for(int j = i; j > 0; j--){  //把第j本和前一本放一层，看是否能有最小高度
                if(tmp_width+books[j-1][0] <= shelf_width){
                    tmp_width += books[j-1][0];
                    h = max(h, books[j-1][1]);
                    dp[i] = min(dp[i], h+dp[j-1]);
                } else{
                    break;
                }
            }
        }
        return dp[n];
    }
};