剑指 Offer 14- II. 剪绳子 II

最新推荐文章于 2022-04-27 23:45:34 发布

Mr.Letian

最新推荐文章于 2022-04-27 23:45:34 发布

阅读量119

点赞数

本文链接：https://blog.csdn.net/MrMyGod/article/details/108345513

版权

剑指Offer 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

剑指 Offer 14- II. 剪绳子 II

贪心算法

class Solution {
    public int cuttingRope(int n) {
        int m = 1000000007;
        if(n<4) return n-1;
        long res = 1L;
       
        int times = n/3;
        int rest = n- times*3;
        for(int i = 1; i<=times-1; ++i){
           res = (res * 3) % m;
        }
        if(rest==1){
             res = res * 4;
        }else if(rest==2){
             res = res * 6;
        }else{
            res = res * 3;
        }
         
        return (int)(res%m);
    }
        
   
}

在这里插入图片描述

快速幂

好文

class Solution {

    private int m = (int)1e9+7;

    public int cuttingRope(int n) {
       
        if(n<4)return n-1;
        
        int base = n/3; 
        int rest = n%3;
        
        if(rest==0){                   //能被3整除 3^base
            return (int)((pow(3,base))%m);
        }else if(rest==1){             //余数为1 3^(base-1)*4
            return (int)((pow(3,base-1)*4)%m);
        }else{                         //余数为2 3^base*2
            return (int)((pow(3,base)*2)%m);
        }
    }
        
    //快速幂
    public long pow(long base, int power){
        long res = 1L;
        while(power>0){
            if((power & 1)==1){  //奇数
                res *= base;
                res %= m;
                // power -= 1;
            }
            base *= base;
            base %= m;
            power>>=1;
        }
        return res;
    }
}