Formatted question description: https://leetcode.ca/all/1105.html

1105. Filling Bookcase Shelves (Medium)

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

Related Topics:
Dynamic Programming

Solution 1. DP

Let dp[i] be the answer of the subproblem in A[0..i].

dp[i] = min( dp[j-1] + max(j, i) | 0 <= j <= i && sum(j, i) <= width )

where max(j, i) is max(A[j], ..., A[i]), and sum(j, i) is sum(A[j], ..., A[i]).

// OJ: https://leetcode.com/problems/filling-bookcase-shelves/

// Time: O(NW)
// Space: O(N)
class Solution {
public:
    int minHeightShelves(vector<vector<int>>& A, int W) {
        int N = A.size();
        vector<int> dp(N, INT_MAX);
        for (int i = 0; i < N; ++i) {
            int sum = 0, mx = 0;
            for (int j = i; j >= 0 && sum + A[j][0] <= W; --j) {
                sum += A[j][0];
                mx = max(mx, A[j][1]);
                dp[i] = min(dp[i], (j - 1 >= 0 ? dp[j - 1] : 0) + mx);
            }
        }
        return dp[N - 1];
    }
};

Java

  • class Solution {
        public int minHeightShelves(int[][] books, int shelf_width) {
            int length = books.length;
            int[] dp = new int[length + 1];
            Arrays.fill(dp, Integer.MAX_VALUE);
            dp[0] = 0;
            for (int i = 1; i <= length; i++) {
                int curHeight = 0, curWidth = 0;
                for (int j = i - 1; j >= 0; j--) {
                    int[] book = books[j];
                    curHeight = Math.max(curHeight, book[1]);
                    curWidth += book[0];
                    if (curWidth > shelf_width)
                        break;
                    dp[i] = Math.min(dp[i], dp[j] + curHeight);
                }
            }
            return dp[length];
        }
    }
    
  • // OJ: https://leetcode.com/problems/filling-bookcase-shelves/
    // Time: O(NW)
    // Space: O(N)
    class Solution {
    public:
        int minHeightShelves(vector<vector<int>>& A, int W) {
            int N = A.size(), dp[1001] = {};
            memset(dp, 0x3f, sizeof(dp));
            dp[0] = 0;
            for (int i = 0; i < N; ++i) {
                int sum = 0, mx = 0;
                for (int j = i; j >= 0 && sum + A[j][0] <= W; --j) {
                    sum += A[j][0];
                    mx = max(mx, A[j][1]);
                    dp[i + 1] = min(dp[i + 1], dp[j] + mx);
                }
            }
            return dp[N];
        }
    };
    
  • # 1105. Filling Bookcase Shelves
    # https://leetcode.com/problems/filling-bookcase-shelves/
    
    class Solution:
        def minHeightShelves(self, books: List[List[int]], shelf_width: int) -> int:
            n = len(books)
            dp = [0] * (n + 1)
            
            for i, (width, height) in enumerate(books, 1):
                dp[i] = dp[i - 1] + height
                
                j = i - 1
                while j > 0 and books[j - 1][0] + width <= shelf_width:
                    height = max(height, books[j - 1][1])
                    width += books[j - 1][0]
                    dp[i] = min(dp[i], dp[j - 1] + height)
                    j -= 1
                
            return dp[-1]
    
    

All Problems

All Solutions