Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

int integerBreak(int n) { if (n == 2) return 1; if (n == 3) return 2; if (n == 4) return 4; if (n % 3 == 1) return pow(3, n/3-1)*4; if (n % 3 == 2) return pow(3, n/3)*2; return pow(3, n/3); }

An explanation and proof of this would be useful @Mxiaoyu

Thx. I'll give the proof after several days.

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.