class Solution {
public int cuttingRope(int n) {
int res = 1;
if(n < 4)
{
return n-1;
}
while(n > 4)
{
res = res * 3;
n = n-3;
}
return res * n;
}
}
剑指Offer 剪绳子(贪心算法)
最新推荐文章于 2024-05-14 14:48:44 发布