Form Largest Integer With Digits That Add up to Target

Description

Given an array of integers cost and an integer target. Return the maximum integer you can paint under the following rules:

• The cost of painting a digit (i+1) is given by cost[i] (0 indexed).
• The total cost used must be equal to target.
• Integer does not have digits 0.

Since the answer may be too large, return it as string.

If there is no way to paint any integer given the condition, return "0".

 

Example 1:

Input: cost = [4,3,2,5,6,7,2,5,5], target = 9
Output: "7772"
Explanation:  The cost to paint the digit '7' is 2, and the digit '2' is 3. Then cost("7772") = 2*3+ 3*1 = 9. You could also paint "977", but "7772" is the largest number.
Digit    cost
  1  ->   4
  2  ->   3
  3  ->   2
  4  ->   5
  5  ->   6
  6  ->   7
  7  ->   2
  8  ->   5
  9  ->   5

Example 2:

Input: cost = [7,6,5,5,5,6,8,7,8], target = 12
Output: "85"
Explanation: The cost to paint the digit '8' is 7, and the digit '5' is 5. Then cost("85") = 7 + 5 = 12.

Example 3:

Input: cost = [2,4,6,2,4,6,4,4,4], target = 5
Output: "0"
Explanation: It's not possible to paint any integer with total cost equal to target.

Example 4:

Input: cost = [6,10,15,40,40,40,40,40,40], target = 47
Output: "32211"

 

Constraints:

• cost.length == 9
• 1 <= cost[i] <= 5000
• 1 <= target <= 5000

Solution(javascript)

// /** 1: Brute Force TLE
//  * @param {number[]} cost
//  * @param {number} target
//  * @return {string}
//  */
// const largestNumber = function (cost, target) {
//   let max = '0'
//   const aux = (number, currentCost, sum = '') => {
//     if (currentCost === target) {
//       if (parseInt(sum, 10) > parseInt(max, 10)) {
//         max = sum
//       }
//       return
//     }
//     if (currentCost > target || number <= 0) {
//       return
//     }

//     aux(number, currentCost + cost[number - 1], sum + number)
//     aux(number - 1, currentCost, sum)
//   }
//   aux(9, 0, '')
//   return max
// }


/**
 * @param {number[]} cost
 * @param {number} target
 * @return {string}
 */
const largestNumber = function (cost, target) {
  const dp = new Array(target + 1).fill(0)

  for (let i = 1; i <= target; i++) {
    dp[i] = -Infinity
    for (let j = 0; j < 9; j++) {
      if (i >= cost[j]) {
        dp[i] = Math.max(
          dp[i], 1 + (dp[i - cost[j]]),
        )
      }
    }
  }
  if (dp[target] < 0) {
    return '0'
  }

  let res = ''
  for (let num = 9; num >= 1; num--) {
    while (target >= cost[num - 1] && dp[target] === dp[target - cost[num - 1]] + 1) {
      target -= cost[num - 1]
      res += num
    }
  }
  return res
}