LeetCode（剑指 Offer）- II. 剪绳子 II

Posted 2022-12-05 放羊的牧码

题目链接：点击打开链接

题目大意：略

解题思路

• ACM模板 - 快速模幂算法

相关企业

• 字节跳动
• 亚马逊
• 美团
• 酷家乐
• Boss 直聘
• 百度

AC 代码

• Java

class Solution 
    public int cuttingRope(int n) 
        if(n <= 3) return n - 1;
        int b = n % 3, p = 1000000007;
        long rem = 1, 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);
    

• C++

class Solution 
public:
    int cuttingRope(int n) 
        if(n <= 3) return n - 1;
        int b = n % 3, p = 1000000007;
        long rem = 1, 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);
    
;