Time: 66 ms (91.68%), Space: 6 MB (92.63%) - LeetHub

nilumbra · Feb 13, 2023 · 8557e3f · 8557e3f
1 parent ab41680
commit 8557e3f
Showing 1 changed file with 19 additions and 0 deletions.
diff --git a/0279-perfect-squares/0279-perfect-squares.cpp b/0279-perfect-squares/0279-perfect-squares.cpp
@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int numSquares(int n) {
+      int arr[n+1];
+      arr[0] = 0;
+      for (int i = 1; i <= n; i++) {
+        int minSteps = 100000;
+        // for each i, find all the steps available
+        for (int sqrt = 1; sqrt * sqrt <= i; sqrt++) {
+          //.minimum steps need to get to (i - sqrt * sqrt)
+          if (arr[i - sqrt * sqrt] + 1 < minSteps) 
+            minSteps = arr[i - sqrt * sqrt] + 1;
+        }
+        arr[i] = minSteps;
+      } 
+
+      return arr[n];
+    }
+};