剪绳子
暴力递归回溯法
public class Solution {
public int cutRope(int target) {
if(target == 2){
return 1;
}else if(target == 3){
return 2;
}
return back_track(target);
}
//递归回溯
public int back_track(int n){
//小于4时,不分长度最大
if(n <= 4){
return n;
}
int result = 0;
for(int i =1; i < n; i++){
result = Math.max(result,i*back_track(n - i));
}
return result;
}
}