LeetCode 279. Perfect Squares

class Solution {
public:
    int dp[100005];
    int numSquares(int n) {
        
        if(n==0)
            return 0;
        dp[0]=0;
        for(int i=1;i<=n;i++)
        {
            dp[i]=INT_MAX;
            for(int j=1;j*j<=i;j++)
            {
                dp[i]=min(dp[i],dp[i-j*j]+1);
            }
        }
        
        return dp[n];
        
    }
};