zoukankan      html  css  js  c++  java
  • LeetCode 1105. Filling Bookcase Shelves

    原题链接在这里:https://leetcode.com/problems/filling-bookcase-shelves/

    题目:

    We have a sequence of books: the i-th book has thickness books[i][0] and height books[i][1].

    We want to place these books in order onto bookcase shelves that have total width shelf_width.

    We choose some of the books to place on this shelf (such that the sum of their thickness is <= shelf_width), then build another level of 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 again 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]], shelf_width = 4
    Output: 6
    Explanation:
    The sum of the heights of the 3 shelves are 1 + 3 + 2 = 6.
    Notice that book number 2 does not have to be on the first shelf.

    Constraints:

    • 1 <= books.length <= 1000
    • 1 <= books[i][0] <= shelf_width <= 1000
    • 1 <= books[i][1] <= 1000

    题解:

    Let dp[i] denotes up to index i-1, the minimum height.

    For the new book i. It could be on the next row. It could be just itself or with previous books. 

    When book i and previous i-1, i-2 ... j, stay on the same row, its total width could not be larger than shelf_width. 

    And coming to j, it could be like j to i-1 is already on this row, i is just added to the same row.

    For each j < i, util total width <= shelf_width, update dp[i] with dp[j-1] + max(book j, j+1, j+2, ... i). When update it uses dp[j-1], since j is already on the next row.

    Time Complexity: O(n^2). n = books.length.

    Space: O(n).

    AC Java: 

     1 class Solution {
     2     public int minHeightShelves(int[][] books, int shelf_width) {
     3         if(books == null || books.length == 0 || shelf_width <= 0){
     4             return 0;
     5         }
     6         
     7         int n = books.length;
     8         int [] dp = new int[n+1];
     9         
    10         for(int i = 1; i<=n; i++){
    11             int w = books[i-1][0];
    12             int h = books[i-1][1];
    13             dp[i] = dp[i-1] + h;
    14             for(int j = i-1; j>0 && w+books[j-1][0]<=shelf_width; j--){
    15                 h = Math.max(h, books[j-1][1]);
    16                 w += books[j-1][0];
    17                 dp[i] = Math.min(dp[i], dp[j-1]+h);
    18             }
    19         }
    20         
    21         return dp[n];
    22     }
    23 }
  • 相关阅读:
    【掉下巴】枪的制造现场
    不引入第三个变量交换两个变量的方法
    [转]科学计算经典算法
    [小练eVC]常用控件之微调按钮
    【收购】LSI 40亿美元并购Agere
    VB6.0不支持鼠标滚轮的解决办法
    一个简单的BP网络C语言程序
    [转]想成为嵌入式程序员应知道的0x10个基本问题
    [zt]关于左值"lvalue"和右值"rvalue"的一点理解
    [掉下巴]细数非洲大山的肘下亡魂
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/11776006.html
Copyright © 2011-2022 走看看