public int[] sortedSquares(int[] A)
{
int i = 0, j = A.length-1;
int k = A.length-1;
int[] tmp = new int[A.length];
while (i <= j)
{
if (A[i] * A[i] <= A[j] * A[j])
{
tmp[k] = A[j] * A[j];
j--;
}
else
{
tmp[k] = A[i] * A[i];
i++;
}
k--;
}
return tmp;
}