Leetcode "Integer Break"

A typical CS style DP based solution:

classsolution (object):def __init__(self): self.hm= {}    defIntegerbreak (self, n):ifNinchself.hm:returnSelf.hm[n] ret=0 forIinchRange (1, N//2 + 1): v1=Self.integerbreak (i) V2= Self.integerbreak (N-i) RET= Max (ret, V1 * v2, V1 * (n-i), I * v2, I * (N-i)) Self.hm[n]=retreturnRet

But there ' s a Math based solution:

Https://leetcode.com/discuss/98249/easy-to-understand-c-with-explanation
In which: ' For any ' integer p strictly greater than 4 , it has the ' property ' such 3 * (p - 3) > p that, which means breaking it into, integers 3 and p - 3 makes the product larger while keeping the sum unchanged "

Leetcode "Integer Break"