绳子每段长度乘积最大
]
class Solution{
public static int cutRope(int n)
{if(n==1){return 1;}
if(n==2||n==3){return n-1;}
int num==1;
while(n>4){n-=3;
num*=3;}return num*n;
}
}
;;
绳子每段长度乘积最大
]
class Solution{
public static int cutRope(int n)
{if(n==1){return 1;}
if(n==2||n==3){return n-1;}
int num==1;
while(n>4){n-=3;
num*=3;}return num*n;
}
}
;;