1.贪心
class Solution {
public:
int cuttingRope(int n) {
assert(2 <= n && n <= 1000);
if (n <= 3) return n - 1;
long res = 1;
while (n > 4) {
n -= 3;
res = (res * 3) % 1000000007;
}
return (int)(res * n % 1000000007);
}
};
03-13
280
11-06
1091
10-12
598
10-12
274
10-18
749
10-14
229