剪绳子 算法_剪绳子（动态规划及贪心法）

int maxProductAfterCutting_solution(int length){

if(length<2)

return 0;

if(length==2)

return 1;

if(length==3)

return 2;

int* products = new int [length+1];

products[0]=0;

products[1]=1;

products[2]=2;

products[3]=3;

int max= 0;

for(int i=4;i<=length;i++){

max=0;

for(int j=1;j<=i/2;j++){

int product = products[j]*products[i-j];

if(max

max=product;

products[i]=max;

}

}

max=products[length];

delete []products;

return max;

}

int maxProductAfterCutting_solution2(int length){//贪心法当n>=5时尽可能多的剪长度为3的绳子，当n=4时剪成两段长度为二的绳子

if(length<2)

return 0;

if(length==2)

return 1;

if(length==3)

return 2;

int timesof3 = length/3;

if(length-timesof3*3==1)

timesof3-=1;

int timesof2 = (length-timesof3*3)/2;

return (int)(pow(3,timesof3))*(int)(pow(2,timesof2));

}