代码随想录算法训练营第41天 343. 整数拆分 96.不同的二叉搜索树

343. 整数拆分

class Solution {
    public int integerBreak(int n) {
        if(n == 2|| n == 3) return n-1;
        if(n == 4) return 4;

        int product = 1;

        while( n > 4){
            product *= 3;
            n-=3;
        }

        return product *n;
    }
}