[LeetCode]Perfect Squares@Python

Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.

Example

Input: n = 12
Output: 3
Explanation: 12 = 4 + 4 + 4.

Solution
DP全部超时，构建静态数组有点欺诈的意思

	class Solution:
    _dp = [0]
    def numSquares(self, n: int) -> int:
        dp = self._dp
        while len(dp) <= n:
            dp += min(dp[-i*i] for i in range(1, int(len(dp)**0.5+1))) + 1,
        return dp[n]