lintcode/leetcode由易至难第20题：Integer Break

Problem:

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

Note: You may assume that n is not less than 2 and not larger than 58.

Code:

public class Solution {
    public int integerBreak(int n) {   //这道题考察的好像是不断破拆成3，如果余2就留下，如果余1就毁成2个2，我的方法有些笨
        int rst = 0;
        if(n == 2){
            return 1;
        }
        if(n == 3){
            return 2;
        }
        if(n == 4){
            return 4;
        }
        else if(n % 3 == 1){
            rst = 4;
            int i = (n - 4) / 3;
            while(i > 0){
                rst = rst * 3;
                i--;
            }
        }
        else if(n % 3 == 2){
            rst = 2;
            int i = (n - 2) / 3;
            while(i > 0){
                rst = rst * 3;
                i--;
            }
        }
        else if(n % 3 == 0){
            rst = 1;
            int i = n / 3;
            while(i > 0){
                rst = rst * 3;
                i --;
            }
        }
        return rst;
    }
}