Time: 584 ms (22.73%), Space: 9.9 MB (26.62%) - LeetHub

Author: subhamengine

0279-perfect-squares/0279-perfect-squares.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int helper(int i,vector<int>&dp){
+        if(i==0) return 0;
+        if(dp[i]!=-1) return dp[i];
+        int minCnt=INT_MAX;
+        for(int num=1;num<=sqrt(i);++num){
+            int curCnt=1+helper(i-(num*num),dp);
+            minCnt=min(curCnt,minCnt);
+        }
+        return dp[i]=minCnt;
+    }
+    
+    int numSquares(int n) {
+        vector<int>dp(n+1,-1);
+        return helper(n,dp);
+    }
+};