Leetcode no. 279

279. Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.

For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return 2 because 13 = 4 + 9.

public class Solution {
    public int numSquares(int n) {
        int num= (int) Math.sqrt(n);
        int[] numbersNeeded= new int[n+1];
        for (int i=1; i<=n ; i++){
            int minNumbers= n;
            for (int j=1; j<=num ; j++){
                if(j*j > i)
                    break;
                else {
                    int tmp= numbersNeeded[i-j*j]+1;
                    if(tmp<minNumbers)
                        minNumbers=tmp;
                }
            }
            numbersNeeded[i]=minNumbers;
        }
        return numbersNeeded[n];
    }
}