Integer Break LeetCode solution in Python

1
class Solution:
2
    def integerBreak(self, n: int) -> int:
3
        dp = [0 for _ in range(n + 1)]
4
        dp[1] = 1
5
        for i in range(2, n + 1):
6
            for j in range(1, i // 2 + 1):
7
                dp[i] = max(j * (i - j), j * dp[i - j], dp[i])
8
        return dp[-1]