LeetCode Q 1130 - Minimum Cost Tree From Leaf Values

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.

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).

Solution: Greedy

Each time we pick locally maxinum value. And then recursivly call the helper method. Since we watn to greedily combine the smaller elements and then combine them with larger number at last.

Code:

int res = 0;
public int mctFromLeafValues(int[] arr) {
  dfs(arr, 0, arr.length - 1);
  return res;
}

private int dfs(int[] arr, int low, int high) {
  if (low > high) return 0;

  if (low == high) return arr[low];

  if (low + 1 == high) {
    res += arr[low] * arr[high];
    return Math.max(arr[low], arr[high]);
  } 

  int maxIndex = low;
  for (int i = low; i <= high; i++) {
    if (arr[i] > arr[maxIndex])
      maxIndex = i;
  }
  
  int left = backtrack(arr, low, maxIndex - 1);
  int right = backtrack(arr, maxIndex + 1, high);
  
  if (left != 0) res += left * arr[maxIndex];
  if (right != 0) res += right * arr[maxIndex];
  
  return arr[maxIndex];
}

Reprint policy