class Solution {
public int[] sortedSquares(int[] nums) {
int len=nums.length;
int[] result=new int[len];
for(int i=0,j=len-1,target=len-1;i<=j;){
if(nums[i]*nums[i]>nums[j]*nums[j]){
result[target]=nums[i]*nums[i];
++i;
}else{
result[target]=nums[j]*nums[j];
--j;
}
--target;
}
return result;
}
}