[Swift]LeetCode1105. 填充书架 | Filling Bookcase Shelves

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/11096572.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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

---

附近的家居城促销，你买回了一直心仪的可调节书架，打算把自己的书都整理到新的书架上。

你把要摆放的书 books 都整理好，叠成一摞：从上往下，第 i 本书的厚度为 books[i][0]，高度为 books[i][1]。

按顺序 将这些书摆放到总宽度为 shelf_width 的书架上。

先选几本书放在书架上（它们的厚度之和小于等于书架的宽度 shelf_width），然后再建一层书架。重复这个过程，直到把所有的书都放在书架上。

需要注意的是，在上述过程的每个步骤中，摆放书的顺序与你整理好的顺序相同。 例如，如果这里有 5 本书，那么可能的一种摆放情况是：第一和第二本书放在第一层书架上，第三本书放在第二层书架上，第四和第五本书放在最后一层书架上。

每一层所摆放的书的最大高度就是这一层书架的层高，书架整体的高度为各层高之和。

以这种方式布置书架，返回书架整体可能的最小高度。 

示例：

输入：books = [[1,1],[2,3],[2,3],[1,1],[1,1],[1,1],[1,2]], shelf_width = 4
输出：6
解释：
3 层书架的高度和为 1 + 3 + 2 = 6 。
第 2 本书不必放在第一层书架上。 

提示：

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

---

20ms

class Solution {
    func minHeightShelves(_ books: [[Int]], _ shelf_width: Int) -> Int {
        return minHeightShelvesRecursionMain(books, shelf_width)
    }
    
    func minHeightShelvesRecursionMain(_ books: [[Int]], _ shelf_width: Int) -> Int {
        guard !books.isEmpty else { return 0 }
        
        var hash = [Int:Int]()
        return minHeightShelvesRecursion(books, shelf_width, 0, &hash)
    }
    
    func minHeightShelvesRecursion(_ books: [[Int]], 
                                   _ shelf_width: Int,
                                   _ bookIndex: Int,
                                   _ hash: inout [Int:Int]) -> Int {
        guard bookIndex < books.count else { return 0 }
        
        if let result = hash[bookIndex] { return result }
        
        var i = bookIndex
        var width = 0
        var height = 0
        var result = Int.max
        
        while i < books.count, width + books[i][0] <= shelf_width {
            width += books[i][0]
            height = max(height, books[i][1])
            
            let next = minHeightShelvesRecursion(books, shelf_width, i+1, &hash)
            result = min(result, height + next)   
            
            i += 1
        }
        
        hash[bookIndex] = result
        return result
    }
}

---

24ms

class Solution {
    func minHeightShelves(_ books: [[Int]], _ shelf_width: Int) -> Int {
        // Initialize array of solutions for each book
        let n = books.count
        var leastHeight = [Int](repeating: 0, count: n + 1)
        for i in (0 ..< n).reversed() {
            var rowThickness = books[i][0]
            var rowHeight = books[i][1]
            leastHeight[i] = rowHeight + leastHeight[i + 1]
            // Loop through all possible shelfmates
            for k in i + 1 ..< n {
                rowThickness += books[k][0]
                if rowThickness > shelf_width {
                    break
                }
                rowHeight = max(rowHeight, books[k][1])
                leastHeight[i] = min(leastHeight[i], rowHeight + leastHeight[k + 1])
            }
        }
        return leastHeight[0]
    }
}

---

28ms

class Solution {
    func minHeightShelves(_ books: [[Int]], _ shelf_width: Int) -> Int {
        var dp = [Int](repeating: 1000 * 1000, count: books.count+1)
        dp[0] = 0
        for i in 1...books.count {
            var b = books[i-1]
            var w = b[0]
            var h = b[1]
            dp[i] = dp[i-1] + h
            for j in stride(from:i-1, to:0, by: -1) {
                w += books[j-1][0]
                h = max(h, books[j-1][1])
                if w > shelf_width { break }
                dp[i] = min(dp[i], dp[j-1] + h)
            }
        }
        return dp[books.count]
    }
}

---

36ms

class Solution {
    func minHeightShelves(_ books: [[Int]], _ shelf_width: Int) -> Int {
        return minHeightShelvesRecursionMain(books, shelf_width)
    }
    
    func minHeightShelvesRecursionMain(_ books: [[Int]], _ shelf_width: Int) -> Int {
        guard !books.isEmpty else { return 0 }
        
        var hash = [Int:Int]()
        return minHeightShelvesRecursion(books, shelf_width, 0, &hash)
    }
    
    func minHeightShelvesRecursion(_ books: [[Int]], 
                                   _ shelf_width: Int,
                                   _ bookIndex: Int,
                                   _ hash: inout [Int:Int]) -> Int {
        guard bookIndex < books.count else { return 0 }
        
        if let result = hash[bookIndex] { return result }
        
        var i = bookIndex
        var width = 0
        var height = 0
        var result = Int.max
        
        while i < books.count, width + books[i][0] <= shelf_width {
            width += books[i][0]
            height = max(height, books[i][1])
            
            let next = minHeightShelvesRecursion(books, shelf_width, i+1, &hash)
            
            if next != Int.max {
                result = min(result, height + next)   
            }
            
            i += 1
        }
        
        hash[bookIndex] = result
        return result
    }
}

---

44ms 

class Solution {
    func minHeightShelves(_ books: [[Int]], _ shelf_width: Int) -> Int {
        // Initialize array of solutions for each book
        let n = books.count
        var leastHeight = [Int](repeating: 0, count: n + 1)
        for i in (0 ..< n).reversed() {
            var rowThickness = books[i][0]
            var rowHeight = books[i][1]
            leastHeight[i] = rowHeight + leastHeight[i + 1]
            // Loop through all possible shelfmates
            for k in i + 1 ..< n {
                rowThickness += books[k][0]
                guard rowThickness <= shelf_width else { break }
                rowHeight = max(rowHeight, books[k][1])
                leastHeight[i] = min(leastHeight[i], rowHeight + leastHeight[k + 1])
            }
        }
        return leastHeight[0]
    }
}

---

Runtime: 64 ms

Memory Usage: 20.8 MB

class Solution {
    let INF:Int = Int(1e9 + 5)
    func minHeightShelves(_ books: [[Int]], _ shelf_width: Int) -> Int {
        let n:Int = books.count
        var dp:[Int] = [Int](repeating:INF,count:n + 1)
        dp[0] = 0
        
        for i in 0..<n
        {
            var width:Int = 0
            var height:Int = 0
            
            for j in i..<n
            {
                width += books[j][0]
                height = max(height, books[j][1])
                
                if width <= shelf_width
                {
                    dp[j + 1] = min(dp[j + 1], dp[i] + height)
                }
            }
        }
        return dp[n]
    }
}