Address ：https://leetcode.cn/problems/squares-of-a-sorted-array/

describe ：
Here's a button Non decreasing order Sorted array of integers nums, return The square of each number A new array of , According to the requirements Non decreasing order Sort .

example 1：

Input ：nums = [-4,-1,0,3,10]
Output ：[0,1,9,16,100]
explain ： After square , The array becomes [16,1,0,9,100]
After ordering , The array becomes [0,1,9,16,100]

example 2：

Input ：nums = [-7,-3,2,3,11]
Output ：[4,9,9,49,121]

violence

answer ：

class Solution {
    
    public int[] sortedSquares(int[] nums) {
    
        int len = nums.length;
        
        for (int i = 0; i < len; i++) {
    
            nums[i] = nums[i] * nums[i];
        }

        Arrays.sort(nums);
        return nums;
    }
}

Space for time

answer ：

class Solution {
    
    public int[] sortedSquares(int[] nums) {
    
        int len = nums.length;
        int left = 0;
        int right = len - 1;
        
        int[] res = new int[len];
        int loc = len - 1;

        while (loc >= 0) {
    
            if (nums[right] * nums[right] > nums[left] * nums[left]) {
    
                res[loc--] = nums[right] * nums[right--];
            } else {
    
                res[loc--] = nums[left] * nums[left++];
            }
        }

        return res;
    }
}