最大乘积
剪绳子
http://www.nowcoder.com/questionTerminal/57d85990ba5b440ab888fc72b0751bf8
public class Solution {
public int cutRope(int target) {
if(target == 2) return 1;
int r = 1;
for(int i = 1; i <= target/2; ++i){
r = Math.max(i*cutRope(target - i), i*(target - i));
}
return r;
}
}
投递珍爱网等公司7个岗位 >