(Algorithms in Javascript) Leetcode 343. Integer Break - Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

leetcode-343-integer-break.js

const integerBreak = (n) => {
  if(n<=3) return n-1;
  if(n%3===0) return Math.pow(3, n/3);
  if(n%3===1) return 4*Math.pow(3, (n-4)/3);
 	return 2*Math.pow(3,parseInt(n/3)); 
}