int k=numssize-1;
for(i=0,j=numsize-1;i<=j;){
if(nums[i]*nums[i]>nums[j]*nums[j])
{
result[k--]=nums[i]*nums[i];
i++;
}
else
{
result[k--]=nums[j]*nums[j];
j--;
}
return result;
int k=numssize-1;
for(i=0,j=numsize-1;i<=j;){
if(nums[i]*nums[i]>nums[j]*nums[j])
{
result[k--]=nums[i]*nums[i];
i++;
}
else
{
result[k--]=nums[j]*nums[j];
j--;
}
return result;