classSolution{public:intcuttingRope(int n){if(n<=3)return n-1;long res =1;while(n>4){
n = n-3;
res = res*3%(1000000007);}
res = res*n%(1000000007);return res;}};
解法一贪心算法,考虑数据溢出的问题class Solution {public: int cuttingRope(int n) { if(n<=3) return n-1; long res =1; while(n>4){ n = n-3; res = res*3%(1000000007); } res = res*n%(1000000007); .