剑指offer14- I. 剪绳子

题目

https://leetcode-cn.com/problems/jian-sheng-zi-lcof/

思路

f(n)=f(n-i)*f(i)…
长度为1 2 3 的时候不必参与计算
从上到下计算出每个分段的最大值即可

class Solution {
    
    public int cuttingRope(int length) {

        if(length<2){
            return 0;
        }
        if(length==2){
            return 1;
        }
        if(length==3){
            return 2;
        }
        int[] product = new  int[length+1];
        product[0] = 0;
        product[1] = 1;
        product[2] = 2;
        product[3] = 3;

        int  max = 0;
        for (int i = 4; i <= length; i++) {
            max =0;
            for (int j = 1; j <= i / 2; j++) {
                int temp = product[j]*product[i-j];
                if(max<temp){
                    max = temp;
                }

                product[i] = max;
            }
        }
        return product[length];
    }

}