NeetCode #676LC-1105Medium1-D Dynamic Programming
← Back to All Problems#676 · #1105 · Filling Bookcase Shelves(填充书架)
📌 Problem Statement & Constraints
Books must be placed in order on shelves of width
shelfWidth. Each book has a thickness and a height; the height of a shelf is the maximum book height on it, and the total height is the sum over shelves. Return the minimum possible total height. Constraints: 1 <= books.length <= 1000, 1 <= thickness_i, height_i <= shelfWidth.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!