完全平方数

注意dp[0]里面是0

class Solution:
    def numSquares(self, n: int) -> int:
        dp=[n+2]*(n+1)
        dp[1]=1
        dp[0]=0#注意这里是0
        for i in range(2,n+1):
            j=1
            while j*j<=i:
                dp[i]=min(dp[i],dp[i-j*j]+1)
                j+=1
        return dp[-1]