Leetcode 977. Squares of a Sorted Array

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/M_sdn/article/details/86560800

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

Example 1:

Input: [-4,-1,0,3,10]
Output: [0,1,9,16,100]

Example 2:

Input: [-7,-3,2,3,11]
Output: [4,9,9,49,121]

Note:

1. 1 <= A.length <= 10000
2. -10000 <= A[i] <= 10000
3. A is sorted in non-decreasing order.

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

https://leetcode.com/contest/weekly-contest-120/problems/squares-of-a-sorted-array/