Add solution #1105

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,136 LeetCode solutions in JavaScript
+# 1,137 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -879,6 +879,7 @@
 1096|[Brace Expansion II](./solutions/1096-brace-expansion-ii.js)|Hard|
 1103|[Distribute Candies to People](./solutions/1103-distribute-candies-to-people.js)|Easy|
 1104|[Path In Zigzag Labelled Binary Tree](./solutions/1104-path-in-zigzag-labelled-binary-tree.js)|Medium|
+1105|[Filling Bookcase Shelves](./solutions/1105-filling-bookcase-shelves.js)|Medium|
 1108|[Defanging an IP Address](./solutions/1108-defanging-an-ip-address.js)|Easy|
 1122|[Relative Sort Array](./solutions/1122-relative-sort-array.js)|Easy|
 1123|[Lowest Common Ancestor of Deepest Leaves](./solutions/1123-lowest-common-ancestor-of-deepest-leaves.js)|Medium|

solutions/1105-filling-bookcase-shelves.js

@@ -0,0 +1,50 @@
+/**
+ * 1105. Filling Bookcase Shelves
+ * https://leetcode.com/problems/filling-bookcase-shelves/
+ * Difficulty: Medium
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[][]} books
+ * @param {number} shelfWidth
+ * @return {number}
+ */
+var minHeightShelves = function(books, shelfWidth) {
+  const dp = new Array(books.length + 1).fill(0);
+
+  for (let i = 1; i <= books.length; i++) {
+    let width = books[i - 1][0];
+    let height = books[i - 1][1];
+    dp[i] = dp[i - 1] + height;
+
+    let j = i - 2;
+    while (j >= 0 && width + books[j][0] <= shelfWidth) {
+      width += books[j][0];
+      height = Math.max(height, books[j][1]);
+      dp[i] = Math.min(dp[i], dp[j] + height);
+      j--;
+    }
+  }
+
+  return dp[books.length];
+};