package leetcode;

/**
 * https://leetcode.com/problems/filling-bookcase-shelves/
 */
public class Problem1105 {
    public int minHeightShelves(int[][] books, int shelf_width) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1105 prob = new Problem1105();
    }
}

@@ -304,16 +304,166 @@
 1105();%0A
+        System.out.println(prob.minHeightShelves(new int%5B%5D%5B%5D%7B%0A            %7B1, 1%7D, %7B2, 3%7D, %7B2, 3%7D, %7B1, 1%7D, %7B1, 1%7D, %7B1, 1%7D, %7B1, 2%7D%0A        %7D, 4)); // 6%0A
     %7D%0A%7D%0A

Update problem 1105