In this guide, you will get 1105. Filling Bookcase Shelves LeetCode Solution with the best time and space complexity. The solution to Filling Bookcase Shelves problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
You are given an array books where books[i] = [thicknessi, heighti] indicates the thickness and height of the ith book. You are also given an integer shelfWidth.
We want to place these books in order onto bookcase shelves that have a total width shelfWidth.
We choose some of the books to place on this shelf such that the sum of their thickness is less than or equal to shelfWidth, 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.
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]], 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.
1105. Filling Bookcase Shelves LeetCode Solution in C++
class Solution {
public:
int minHeightShelves(vector<vector<int>>& books, int shelfWidth) {
// dp[i] := the minimum height to place the first i books
vector<int> dp(books.size() + 1, INT_MAX);
dp[0] = 0;
for (int i = 0; i < books.size(); ++i) {
int sumThickness = 0;
int maxHeight = 0;
// Place books[j..i] on a new shelf.
for (int j = i; j >= 0; --j) {
const int thickness = books[j][0];
const int height = books[j][1];
sumThickness += thickness;
if (sumThickness > shelfWidth)
break;
maxHeight = max(maxHeight, height);
dp[i + 1] = min(dp[i + 1], dp[j] + maxHeight);
}
}
return dp.back();
}
}; /* code provided by PROGIEZ */
1105. Filling Bookcase Shelves LeetCode Solution in Java
class Solution {
public int minHeightShelves(int[][] books, int shelfWidth) {
final int n = books.length;
// dp[i] := the minimum height to place the first i books
int[] dp = new int[n + 1];
Arrays.fill(dp, Integer.MAX_VALUE);
dp[0] = 0;
for (int i = 0; i < books.length; ++i) {
int sumThickness = 0;
int maxHeight = 0;
// Place books[j..i] on a new shelf.
for (int j = i; j >= 0; --j) {
final int thickness = books[j][0];
final int height = books[j][1];
sumThickness += thickness;
if (sumThickness > shelfWidth)
break;
maxHeight = Math.max(maxHeight, height);
dp[i + 1] = Math.min(dp[i + 1], dp[j] + maxHeight);
}
}
return dp[n];
}
} // code provided by PROGIEZ
1105. Filling Bookcase Shelves LeetCode Solution in Python
class Solution:
def minHeightShelves(self, books: list[list[int]], shelfWidth: int) -> int:
# dp[i] := the minimum height to place the first i books
dp = [0] + [math.inf] * len(books)
for i in range(len(books)):
sumThickness = 0
maxHeight = 0
# Place books[j..i] on a new shelf.
for j in range(i, -1, -1):
thickness, height = books[j]
sumThickness += thickness
if sumThickness > shelfWidth:
break
maxHeight = max(maxHeight, height)
dp[i + 1] = min(dp[i + 1], dp[j] + maxHeight)
return dp[-1] # code by PROGIEZ
