14_2_剑指offer_剪绳子

贪心算法

class Solution {
    public int cuttingRope(int n) {
        //用贪心算法，当n=5，6，7，8，9.。。。的时候
        //(n-3)*3>(n-2)*2>n
        if (n == 2) return 1;
        if (n == 3) return 2;
        if (n == 4) return 4;
        long res = 1L;
        while (n >= 5) {
            res = res * 3 % 1000000007;
            n = n - 3;
        }
        res = res * n % 1000000007;
        return (int) res;
    }
}