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

Note: you may assume that n is not less than 2.

 

public class Solution {
    public int integerBreak(int n) {
        //Two issues: 
        //1. factors should be <= 4
        //2. As many 3 as possible
        if (n==2) return 1; 
        if (n==3) return 2;
        int product = 1; 
        while (n > 4) {
            product = product*3; 
            n-=3; 
        }
        product = product*n;
        return product;
    }
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s