solutions/0343-integer-break.js

/**
 * 343. Integer Break
 * https://leetcode.com/problems/integer-break/
 * Difficulty: Medium
 *
 * Given an integer n, break it into the sum of k positive integers, where k >= 2,
 * and maximize the product of those integers.
 *
 * Return the maximum product you can get.
 */

/**
 * @param {number} n
 * @return {number}
 */
var integerBreak = function(n) {
  if (n <= 3) return n - 1;
  let product = 1;
  while (n > 4) {
    product *= 3;
    n -= 3;
  }
  return product * n;
};