[LeetCode] 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.

Solution：

        思路：动态规划类型，题意是“给定一个正整数n，将其分成多个正整数相加的形式，求解各个加数的乘积的最大值”，状态转换方程为 

f(k) = max{   ∑( (k - i) * f(i) )   }，其中 i 的取值范围是 [1, k)。本题中我所采用的算法的时间复杂度为O(n^2)，思路简单易实现，但不够快捷。

代码如下：

#include<iostream>
#include<vector>
using namespace std;

/*
class Solution {
public:
    int integerBreak(int n) {
        if(n == 1)
            return 0;
        if(n == 2)
            return 1;
            
        int result = max_num(n);
        return result;
    }
    
    int max_num(int n) {
    	if(n == 1)
    		return 0;
    	if(n == 2)
    		return 1;
    	
    	int result = 0;
    	for(int i = 1 ; i < n ; i ++)
    	{
 //   		int left  = max(i, max_num(i));
    		int right = max(n - i, max_num(n - i));
    		result = max(result, i * right);
		}
		return result;
	}
};
*/
class Solution {
public:
    int integerBreak(int n) {
    	if(n == 1)
    		return 0;
    	if(n == 2)
    		return 1;
    		
    	vector<int> array(n + 1, 0);
		array[1] = 0;
		array[2] = 1;
	
    	for(int i = 3 ; i <= n ; i ++) {
    		int result = 0;
    		for(int j = 1 ; j < i ; j ++) {
    			int left  = i - j;
				int right = max(j, array[j]);
    			result = max(result, left * right);
			}
			array[i] = result;
		}
    	
    	return array[n];
    }
};

int main()
{
	Solution text;
	cout << text.integerBreak(29) << endl;
	return 0;
}