g1101_1200.s1105_filling_bookcase_shelves.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g1101_1200.s1105_filling_bookcase_shelves;
// #Medium #Array #Dynamic_Programming #2022_02_28_Time_4_ms_(23.85%)_Space_42.7_MB_(31.80%)
import java.util.Arrays;
public class Solution {
public int minHeightShelves(int[][] books, int shelfWidth) {
int n = books.length;
int[] dp = new int[n + 1];
Arrays.fill(dp, Integer.MAX_VALUE);
dp[0] = 0;
for (int i = 1; i <= n; i++) {
int widthLeft = shelfWidth;
int maxH = 0;
for (int j = i - 1; j >= 0; j--) {
widthLeft -= books[j][0];
maxH = Math.max(maxH, books[j][1]);
if (widthLeft >= 0) {
dp[i] = Math.min(dp[i], maxH + dp[j]);
}
}
}
return dp[n];
}
}