输入：nums = [-4,-1,0,3,10]

输出：[0,1,9,16,100]

解释：平方后，数组变为 [16,1,0,9,100]

排序后，数组变为 [0,1,9,16,100]

输入：nums = [-7,-3,2,3,11]

输出：[4,9,9,49,121]

1 <= nums.length <= 10^4

-10^4 <= nums[i] <= 10^4

nums 已按 非递减顺序 排序

请你设计时间复杂度为 O(n) 的算法解决本问题

public int[] sortedSquares(int[] A) {
    int[] res = new int[A.length];
    for (int i = 0; i < A.length; i++) {
        res[i] = A[i] * A[i];
    }
    Arrays.sort(res);
    return res;
}