[Swift]LeetCode1130. 叶值的最小代价生成树 | Minimum Cost Tree From Leaf Values

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

Given an array arr of positive integers, consider all binary trees such that:

• Each node has either 0 or 2 children;
• The values of arr correspond to the values of each leaf in an in-order traversal of the tree.  (Recall that a node is a leaf if and only if it has 0 children.)
• The value of each non-leaf node is equal to the product of the largest leaf value in its left and right subtree respectively.

Among all possible binary trees considered, return the smallest possible sum of the values of each non-leaf node.  It is guaranteed this sum fits into a 32-bit integer.

Example 1:

Input: arr = [6,2,4]
Output: 32
Explanation:
There are two possible trees.  The first has non-leaf node sum 36, and the second has non-leaf node sum 32.

    24            24
   /            /  
  12   4        6    8
 /                 / 
6    2             2   4

Constraints:

• 2 <= arr.length <= 40
• 1 <= arr[i] <= 15
• It is guaranteed that the answer fits into a 32-bit signed integer (ie. it is less than 2^31).

---

给你一个正整数数组 arr，考虑所有满足以下条件的二叉树：

• 每个节点都有 0 个或是 2 个子节点。
• 数组 arr 中的值与树的中序遍历中每个叶节点的值一一对应。（知识回顾：如果一个节点有 0 个子节点，那么该节点为叶节点。）
• 每个非叶节点的值等于其左子树和右子树中叶节点的最大值的乘积。

在所有这样的二叉树中，返回每个非叶节点的值的最小可能总和。这个和的值是一个 32 位整数。

示例：

输入：arr = [6,2,4]
输出：32
解释：
有两种可能的树，第一种的非叶节点的总和为 36，第二种非叶节点的总和为 32。

    24            24
   /            /  
  12   4        6    8
 /                 / 
6    2             2   4

提示：

• 2 <= arr.length <= 40
• 1 <= arr[i] <= 15
• 答案保证是一个 32 位带符号整数，即小于 2^31。

---

12ms

class Solution {
    func mctFromLeafValues(_ arr1: [Int]) -> Int {
        guard arr1.count > 0 else { return 0 }
        guard arr1.count > 1 else { return arr1[0] }
        
        var arr = [Int.max]
        arr.append(contentsOf: arr1)
        arr.append(Int.max)
        var sum = 0
        while arr.count > 4 {
            var mn = arr[1]
            var idx = 1
            for i in stride(from: 2, to: arr.count-1, by: 1) {
                if mn > arr[i] {
                    mn = arr[i]
                    idx = i
                }
            }
            var toMultiply = arr[idx-1] > arr[idx+1] ? arr[idx+1] : arr[idx-1]
            sum += mn * toMultiply
            arr.remove(at: idx)
        }
        
        return sum + arr[1] * arr[2]
    }
}

---

20ms

class Solution {
    func mctFromLeafValues(_ arr: [Int]) -> Int {
        var solution = 0
        var currentArray = arr
        
        while currentArray.count > 1 {
            let nextIndex = currentArray.firstIndex(of: currentArray.min()!)!
            
            if nextIndex > 0 && nextIndex < currentArray.count - 1 {
                solution += currentArray[nextIndex] * 
                            min(currentArray[nextIndex-1], currentArray[nextIndex+1])
            } else {
                solution += currentArray[nextIndex] * 
                            (nextIndex == 0 ? currentArray[nextIndex+1] : currentArray[nextIndex-1])
            }
            
            currentArray.remove(at: nextIndex)
        }
        
        
        return solution
    }
}

---

Runtime: 36 ms

Memory Usage: 20.9 MB

class Solution {
    func mctFromLeafValues(_ arr: [Int]) -> Int {
        var dp:[[Int]] = [[Int]](repeating:[Int](repeating:0,count:45),count:45)
        var maxn:[[Int]] = [[Int]](repeating:[Int](repeating:0,count:45),count:45)
        var n:Int = arr.count
        for i in 0..<n
        {
            maxn[i][i] = arr[i]
            for j in (i + 1)..<n
            {
                 maxn[i][j] = max(maxn[i][j - 1], arr[j])
            }
        }
        for d in 2...n
        {
            var i:Int = 0
            while(i + d - 1 < n)
            {
                var j:Int = i + d - 1
                dp[i][j] = (1<<60)
                for k in i..<j
                {
                    dp[i][j] = min(dp[i][j],maxn[i][k] * maxn[k+1][j] + dp[i][k] + dp[k + 1][j])
                }
                i += 1
            }
        }
        return (dp[0][n - 1])
    }
}