LeetCode 343. Integer Break 题解

343. Integer Break

 

Question Editorial Solution

  My Submissions

• Total Accepted: 29402
• Total Submissions: 66455
• Difficulty: Medium
• Contributors: Admin

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).

Note: You may assume that n is not less than 2 and not larger than 58.

解题思路:

将n分解为尽可能多的3的和.原因 为pow(2,3)<pow(3,2)且2*3=3*2。

代码展示：

class Solution {
public:
    int integerBreak(int n) {
        if(n==2) return 1;
        if(n==3) return 2;
        vector<int> res;
        while(n-3>=2)
        {
            res.push_back(3);
            n-=3;
        }
        if(n) res.push_back(n);
        int ans=1;
        for(int i=0;i<res.size();i++)
        {
            ans*=res[i];
        }
        return ans;
        
    }
};