343. Integer Break

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.

class Solution {
private:
    int integerBreakHelper(int n) {
        return n > 4 ? 3 * integerBreakHelper(n - 3) : n;
    }
public:
    int integerBreak(int n) {
        return n <= 3 ? n - 1 : integerBreakHelper(n);
    }
};