LeetCode 343

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.

Hint:

There is a simple O(n) solution to this problem.
You may check the breaking results of n ranging from 7 to 10 to discover the regularities.

/*************************************************************************
    > File Name: LeetCode343.c
    > Author: Juntaran
    > Mail: Jacinthmail@gmail.com
    > Created Time: Tue 10 May 2016 04:17:35 PM CST
 ************************************************************************/
 
/*************************************************************************
    
    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.

    Hint:

    There is a simple O(n) solution to this problem.
    You may check the breaking results of n ranging from 7 to 10 to discover the regularities.

 ************************************************************************/

#include<stdio.h>

int integerBreak( int n )
{
    if( n <= 2 )
    {
        return 1;
    }
    if( n == 3 )
    {
        return 2;
    }
    int ret = 1;
    while( n > 4 )
    {
        ret *= 3;
        n -= 3;
    }
    return ret*n;
}

int main()
{
    int n = 7;
    int ret = integerBreak(n);
    printf("%d
",ret);

    return 0;
}