Minimum number of squares whose sum equals to given number N | set 2

// Java program to represent 
// N as the sum of minimum 
// square numbers.
import java.util.*;
class GFG{

// Function for finding
// minimum square numbers
static Vector<Integer> minSqrNum(int n)
{
  // A[i] of array arr store
  // minimum count of
  // square number to get i
  int []arr = new int[n + 1];
  int k = 0;

  // sqrNum[i] store last
  // square number to get i
  int []sqrNum = new int[n + 1];
  Vector<Integer> v = new Vector<>();

  // Initialize
  arr[0] = 0;
  sqrNum[0] = 0;

  // Find minimum count of
  // square number for
  // all value 1 to n
  for (int i = 1; i <= n; i++) 
  {
    // In worst case it will
    // be arr[i-1]+1 we use all
    // combination of a[i-1] and add 1
    arr[i] = arr[i - 1] + 1;
    sqrNum[i] = 1;

    k = 1;
    // Check for all square
    // number less or equal to i
    while (k * k <= i) 
    {
      // if it gives less
      // count then update it
      if (arr[i] > arr[i - k * k] + 1) 
      {
        arr[i] = arr[i - k * k] + 1;
        sqrNum[i] = k * k;
      }
      k++;
    }
  }

  // Vector v stores optimum
  // square number whose sum give N
  while (n > 0) 
  {
    v.add(sqrNum[n]);
    n -= sqrNum[n];
  }
  return v;
}

// Driver code
public static void main(String[] args)
{
  int n = 10;

  Vector<Integer> v;

  // Calling function
  v = minSqrNum(n);

  // Printing vector
  for (int i = 0; i <v.size(); i++) 
  {
    System.out.print(v.elementAt(i));
    if (i+1 != v.size())
      System.out.print(" + ");
  }
}
}

// This code is contributed by gauravrajput1