[Leetcode] Perfect Squares

Well, after seeing the similar problems, your may has known how to solve this problem. Yeah, just to construct larger numbers from smaller numbers by adding perfect squares to them. This post shares a nice code and is rewritten below.

1 classSolution {2  Public:3     intNumsquares (intN) {4vector<int> dp (n +1);5Iota (Dp.begin (), Dp.end (),0);6         intUB =sqrt (n), next;7          for(inti =0; I <= N; i++) {8              for(intj =1; J <= UB; J + +) {9Next = i + J *J;Ten                 if(Next > N) Break; OneDp[next] = min (Dp[next], Dp[i] +1); A             } -         } -         returnDp[n]; the     } -};

[Leetcode] Perfect Squares