题目描述
解题思路
c++
#include <iostream>
#include <vector>
using namespace std ;
class Solution {
private :
vector <int > memo;
int max3(int a, int b, int c)
{
return max(a,max(b,c));
}
int getMax(int n)
{
if (n == 1 )
{
return 1 ;
}
if (memo[n]!=-1 )
return memo[n];
int res = -1 ;
for (int i =1 ;i<n;i++)
{
res = max3(res,i*getMax(n-i),i*(n-i));
}
memo[n] = res;
return res;
}
public :
int integerBreak(int n) {
memo = vector <int > (n+1 ,-1 );
return getMax(n);
}
};
int main()
{
cout <<Solution().integerBreak(38 )<<endl;
return 0 ;
}
#include <iostream>
#include <vector>
using namespace std ;
class Solution {
private :
vector <int > memo;
int max3(int a, int b, int c)
{
return max(a,max(b,c));
}
public :
int integerBreak(int n) {
vector <int > memo(n+1 ,-1 );
memo[1 ] = 1 ;
for (int i = 2 ; i<=n; i++)
for (int j = 1 ;j<=i-1 ;j++)
memo[i] = max3(memo[i],j*(i-j),j*memo[i-j]);
return memo[n];
}
};
int main()
{
cout <<Solution().integerBreak(38 )<<endl;
return 0 ;
}
java
class Solution {
public int integerBreak (int n) {
int [] dp = new int [n];
dp[1 ] = 1 ;
for (int i = 2 ;i<=n;i++)
{
for (int j = 1 ;j<=i-1 ;j++)
{
dp[i]= Math.max(dp[i],Math.max(j*(i-j),j*dp[i-j]));
}
}
return dp[n];
}
}