Perfect Square

Method 1 Greedy

Method 2 Dynamic Programming

数字不是完全平方数：是的都是不管多长，不是就是不是

Step 1: DP定义

• dp[i] represent the minimum number of perfect square numbers need to sum to i

Step 2: Base Case