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

For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).

/** * @param {number} n * @return {number} */var integerBreak = function(n) {    var nn = n%3;    if(n<3){        return 1;    }else if(n==3){        return 2;    }    if(nn===1){        return Math.pow(3,(Math.floor(n/3)-1))*4;    }else if(nn===2){        return Math.pow(3,Math.floor(n/3))*2;    }else{        return Math.pow(3,n/3);    }};