【LeetCode】剑指 Offer 14. 剪绳子

【LeetCode】剑指 Offer 14. 剪绳子

两道题目的区别在于第二题 n 的取值范围更大

package offer;

public class Solution14 {
    public static void main(String[] args) {
        int n = 100;
        Solution14 solution = new Solution14();
        System.out.println(solution.method1(n));
        System.out.println(solution.method2(n));
    }

    private int method1(int n){
        if(n <= 3) return n - 1;
        int a = n / 3;
        int b = n % 3;
        if(b == 0) return (int)Math.pow(3, a);
        if(b == 1) return (int)Math.pow(3, a-1) * 4;
        return (int)Math.pow(3, a) * 2;
    }

    private int method2(int n){
        if(n <= 3) return n - 1;
        int b = n % 3, p = 1000000007;
        long rem = 1;
        long x = 3;
        for(int a = n / 3 - 1; a > 0; a /= 2){
            if(a % 2 == 1) rem = (rem * x) % p;
            x = (x * x) % p;
        }
        if(b == 0) return (int)(rem * 3 % p);
        if(b == 1) return (int)(rem * 4 % p);
        return (int)(rem * 6 % p);
    }
}

//method1
//时间复杂度为 O(1)
//空间复杂度为 O(1)
//method2
//时间复杂度为 O(log2n)，二分法为对数级复杂度
//空间复杂度为 O(1)