有序数组的平方(Lc977)——双指针

给你一个按 非递减顺序 排序的整数数组 nums，返回 每个数字的平方 组成的新数组，要求也按 非递减顺序 排序。

示例 1：

输入：nums = [-4,-1,0,3,10]
输出：[0,1,9,16,100]
解释：平方后，数组变为 [16,1,0,9,100]
排序后，数组变为 [0,1,9,16,100]

示例 2：

输入：nums = [-7,-3,2,3,11]
输出：[4,9,9,49,121]

提示：

• 1 <= nums.length <= 104
• -104 <= nums[i] <= 104
• nums 已按 非递减顺序 排序

进阶：

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

问题简要描述：返回有序数组的平方 

Java

class Solution {
    public int[] sortedSquares(int[] nums) {
        int n = nums.length;
        int[] ans = new int[n];
        for (int i = 0, j = n - 1, k = n - 1; i <= j; k--) {
            int a = nums[i] * nums[i];
            int b = nums[j] * nums[j];
            if (a > b) {
                ans[k] = a;
                i++;
            } else {
                ans[k] = b;
                j--;
            }
        }
        return ans;
    }
}

 Python3

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        ans = []
        i, j = 0, len(nums) - 1
        while i <= j:
            a = nums[i] * nums[i]
            b = nums[j] * nums[j]
            if a > b:
                ans.append(a)
                i += 1
            else:
                ans.append(b)
                j -= 1
        return ans[::-1]

TypeScript

function sortedSquares(nums: number[]): number[] {
    let n = nums.length;
    let ans = Array(n).fill(0);
    for (let i = 0, j = n - 1, k = n - 1; i <= j; k--) {
        let a = nums[i] * nums[i];
        let b = nums[j] * nums[j];
        if (a > b) {
            ans[k] = a;
            i++;
        } else {
            ans[k] = b;
            j--;
        }
    }
    return ans;    
};

C++

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
		int n = nums.size();
		vector<int> ans(n);
		for (int i = 0, j = n - 1, k = n - 1;i <= j;k--) {
			int a = nums[i] * nums[i];
			int b = nums[j] * nums[j];
			if (a > b) {
				ans[k] = a;
				i++;
			} else {
				ans[k] = b;
				j--;
			}
		}
		return ans;
    }
};

Go

func sortedSquares(nums []int) []int {
	n := len(nums)
	ans := make([]int, n)
	for i, j, k := 0, n-1, n-1; i <= j; k-- {
		a := nums[i] * nums[i]
		b := nums[j] * nums[j]
		if a > b {
			ans[k] = a
			i += 1
		} else {
			ans[k] = b
			j -= 1
		}
	}
	return ans
}