leetcode 279. Perfect Squares

class Solution(object):    def numSquares(self, n):        dp = [10000 for i in range(n+1)]        dp[0] = 0        for i in range(1,n+1,1):            j = 1            while(j**2 <= i):                dp[i] = min(dp[i],dp[i-j**2]+1)                j += 1        return dp[-1]