solution:
贪心
- const int mod = 1000000007;
- class Solution {
- public:
- int cuttingRope(int n) {
- if(n <= 3) return n - 1;
-
- long res = 1;
- while(n > 4){
- res *= 3;
- res = res % mod;
- n -= 3;
- }
- return (int)(res * n % mod);
- }
- };